/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:40:27,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:40:27,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:40:27,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:40:27,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:40:27,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:40:27,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:40:27,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:40:27,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:40:27,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:40:27,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:40:27,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:40:27,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:40:27,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:40:27,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:40:27,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:40:27,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:40:27,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:40:27,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:40:27,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:40:27,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:40:27,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:40:27,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:40:27,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:40:27,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:40:27,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:40:27,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:40:27,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:40:27,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:40:27,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:40:27,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:40:27,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:40:27,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:40:27,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:40:27,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:40:27,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:40:27,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:40:27,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:40:27,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:40:27,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:40:27,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:40:27,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-02-10 20:40:27,685 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:40:27,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:40:27,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:40:27,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:40:27,687 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:40:27,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:40:27,687 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:40:27,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:40:27,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:40:27,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:40:27,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:40:27,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:40:27,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:40:27,688 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:40:27,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:40:27,689 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:40:27,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:40:27,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:40:27,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:40:27,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:40:27,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:40:27,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:27,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:40:27,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:40:27,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:40:27,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:40:27,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:40:27,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:40:27,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:40:27,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:40:27,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:40:27,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:40:28,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:40:28,004 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:40:28,004 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:40:28,005 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl [2020-02-10 20:40:28,005 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl' [2020-02-10 20:40:28,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:40:28,040 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:40:28,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:28,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:40:28,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:40:28,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:28,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:40:28,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:40:28,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:40:28,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... [2020-02-10 20:40:28,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:40:28,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:40:28,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:40:28,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:40:28,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:28,172 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:40:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:40:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:40:28,174 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:40:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:40:28,175 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:40:28,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:40:28,176 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:40:28,177 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:40:28,177 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:40:28,177 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:40:28,177 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:40:28,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:40:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:40:28,178 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:40:28,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:40:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:40:28,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:40:28,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:40:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:40:28,179 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:40:28,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:40:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:40:28,180 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:40:28,180 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 20:40:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 20:40:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 20:40:28,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 20:40:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 20:40:28,183 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 20:40:28,184 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:40:28,488 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:40:28,488 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:40:28,492 INFO L202 PluginConnector]: Adding new model example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:28 BoogieIcfgContainer [2020-02-10 20:40:28,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:40:28,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:40:28,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:40:28,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:40:28,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:28" (1/2) ... [2020-02-10 20:40:28,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcfe2aa and model type example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:40:28, skipping insertion in model container [2020-02-10 20:40:28,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:28" (2/2) ... [2020-02-10 20:40:28,500 INFO L109 eAbstractionObserver]: Analyzing ICFG example_9.bpl [2020-02-10 20:40:28,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:40:28,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:40:28,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:40:28,518 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:40:28,727 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-02-10 20:40:28,745 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:40:28,745 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:40:28,745 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:40:28,746 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:40:28,746 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:40:28,746 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:40:28,746 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:40:28,746 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:40:28,763 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 120 transitions [2020-02-10 20:40:28,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 120 transitions [2020-02-10 20:40:29,685 INFO L129 PetriNetUnfolder]: 1793/2334 cut-off events. [2020-02-10 20:40:29,686 INFO L130 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2020-02-10 20:40:29,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2334 events. 1793/2334 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8911 event pairs. 0/2333 useless extension candidates. Maximal degree in co-relation 2090. Up to 630 conditions per place. [2020-02-10 20:40:29,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 120 transitions [2020-02-10 20:40:30,564 INFO L129 PetriNetUnfolder]: 1793/2334 cut-off events. [2020-02-10 20:40:30,564 INFO L130 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2020-02-10 20:40:30,637 INFO L76 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2334 events. 1793/2334 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8911 event pairs. 0/2333 useless extension candidates. Maximal degree in co-relation 2090. Up to 630 conditions per place. [2020-02-10 20:40:30,686 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2736 [2020-02-10 20:40:30,687 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:40:30,890 INFO L206 etLargeBlockEncoding]: Checked pairs total: 756 [2020-02-10 20:40:30,891 INFO L214 etLargeBlockEncoding]: Total number of compositions: 10 [2020-02-10 20:40:30,895 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 110 transitions [2020-02-10 20:40:33,501 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 20196 states. [2020-02-10 20:40:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 20196 states. [2020-02-10 20:40:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:33,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,672 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash 114387570, now seen corresponding path program 1 times [2020-02-10 20:40:33,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078296922] [2020-02-10 20:40:33,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078296922] [2020-02-10 20:40:33,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:33,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370747452] [2020-02-10 20:40:33,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:33,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:33,922 INFO L87 Difference]: Start difference. First operand 20196 states. Second operand 3 states. [2020-02-10 20:40:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,043 INFO L93 Difference]: Finished difference Result 18916 states and 109908 transitions. [2020-02-10 20:40:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:35,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,317 INFO L225 Difference]: With dead ends: 18916 [2020-02-10 20:40:35,317 INFO L226 Difference]: Without dead ends: 18915 [2020-02-10 20:40:35,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2020-02-10 20:40:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 18915. [2020-02-10 20:40:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18915 states. [2020-02-10 20:40:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18915 states to 18915 states and 109907 transitions. [2020-02-10 20:40:36,984 INFO L78 Accepts]: Start accepts. Automaton has 18915 states and 109907 transitions. Word has length 28 [2020-02-10 20:40:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,985 INFO L479 AbstractCegarLoop]: Abstraction has 18915 states and 109907 transitions. [2020-02-10 20:40:36,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18915 states and 109907 transitions. [2020-02-10 20:40:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:37,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40: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] [2020-02-10 20:40:37,095 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -520253774, now seen corresponding path program 1 times [2020-02-10 20:40:37,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936324325] [2020-02-10 20:40:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936324325] [2020-02-10 20:40:37,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:37,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843738829] [2020-02-10 20:40:37,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:37,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:37,177 INFO L87 Difference]: Start difference. First operand 18915 states and 109907 transitions. Second operand 3 states. [2020-02-10 20:40:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,526 INFO L93 Difference]: Finished difference Result 15971 states and 88467 transitions. [2020-02-10 20:40:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:37,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,630 INFO L225 Difference]: With dead ends: 15971 [2020-02-10 20:40:37,630 INFO L226 Difference]: Without dead ends: 15971 [2020-02-10 20:40:37,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15971 states. [2020-02-10 20:40:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15971 to 15971. [2020-02-10 20:40:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15971 states. [2020-02-10 20:40:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15971 states to 15971 states and 88467 transitions. [2020-02-10 20:40:39,672 INFO L78 Accepts]: Start accepts. Automaton has 15971 states and 88467 transitions. Word has length 28 [2020-02-10 20:40:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,673 INFO L479 AbstractCegarLoop]: Abstraction has 15971 states and 88467 transitions. [2020-02-10 20:40:39,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 15971 states and 88467 transitions. [2020-02-10 20:40:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:39,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,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] [2020-02-10 20:40:39,726 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1967135382, now seen corresponding path program 1 times [2020-02-10 20:40:39,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303982375] [2020-02-10 20:40:39,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303982375] [2020-02-10 20:40:39,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:39,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252352030] [2020-02-10 20:40:39,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:39,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:39,772 INFO L87 Difference]: Start difference. First operand 15971 states and 88467 transitions. Second operand 3 states. [2020-02-10 20:40:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,893 INFO L93 Difference]: Finished difference Result 10243 states and 54163 transitions. [2020-02-10 20:40:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:39,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,954 INFO L225 Difference]: With dead ends: 10243 [2020-02-10 20:40:39,955 INFO L226 Difference]: Without dead ends: 10243 [2020-02-10 20:40:39,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2020-02-10 20:40:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 10243. [2020-02-10 20:40:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10243 states. [2020-02-10 20:40:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 54163 transitions. [2020-02-10 20:40:40,881 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 54163 transitions. Word has length 28 [2020-02-10 20:40:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,882 INFO L479 AbstractCegarLoop]: Abstraction has 10243 states and 54163 transitions. [2020-02-10 20:40:40,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 54163 transitions. [2020-02-10 20:40:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:40,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,931 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2067096892, now seen corresponding path program 1 times [2020-02-10 20:40:40,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523033715] [2020-02-10 20:40:40,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523033715] [2020-02-10 20:40:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:41,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557556428] [2020-02-10 20:40:41,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:41,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:41,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:41,009 INFO L87 Difference]: Start difference. First operand 10243 states and 54163 transitions. Second operand 3 states. [2020-02-10 20:40:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,114 INFO L93 Difference]: Finished difference Result 9987 states and 52243 transitions. [2020-02-10 20:40:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:41,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,186 INFO L225 Difference]: With dead ends: 9987 [2020-02-10 20:40:41,187 INFO L226 Difference]: Without dead ends: 9987 [2020-02-10 20:40:41,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9987 states. [2020-02-10 20:40:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9987 to 9987. [2020-02-10 20:40:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9987 states. [2020-02-10 20:40:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9987 states to 9987 states and 52243 transitions. [2020-02-10 20:40:41,669 INFO L78 Accepts]: Start accepts. Automaton has 9987 states and 52243 transitions. Word has length 28 [2020-02-10 20:40:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,669 INFO L479 AbstractCegarLoop]: Abstraction has 9987 states and 52243 transitions. [2020-02-10 20:40:41,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 9987 states and 52243 transitions. [2020-02-10 20:40:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:41,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,695 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -77951046, now seen corresponding path program 1 times [2020-02-10 20:40:41,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322158102] [2020-02-10 20:40:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,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 20:40:41,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322158102] [2020-02-10 20:40:41,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:41,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621672002] [2020-02-10 20:40:41,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:41,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:41,736 INFO L87 Difference]: Start difference. First operand 9987 states and 52243 transitions. Second operand 3 states. [2020-02-10 20:40:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,801 INFO L93 Difference]: Finished difference Result 6171 states and 30927 transitions. [2020-02-10 20:40:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:41,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,828 INFO L225 Difference]: With dead ends: 6171 [2020-02-10 20:40:41,829 INFO L226 Difference]: Without dead ends: 6171 [2020-02-10 20:40:41,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2020-02-10 20:40:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6171. [2020-02-10 20:40:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6171 states. [2020-02-10 20:40:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 30927 transitions. [2020-02-10 20:40:42,138 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 30927 transitions. Word has length 28 [2020-02-10 20:40:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,139 INFO L479 AbstractCegarLoop]: Abstraction has 6171 states and 30927 transitions. [2020-02-10 20:40:42,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 30927 transitions. [2020-02-10 20:40:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:42,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,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] [2020-02-10 20:40:42,162 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1337464426, now seen corresponding path program 1 times [2020-02-10 20:40:42,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908861795] [2020-02-10 20:40:42,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908861795] [2020-02-10 20:40:42,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:42,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668712139] [2020-02-10 20:40:42,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:42,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:42,226 INFO L87 Difference]: Start difference. First operand 6171 states and 30927 transitions. Second operand 3 states. [2020-02-10 20:40:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,267 INFO L93 Difference]: Finished difference Result 3883 states and 18511 transitions. [2020-02-10 20:40:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:42,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,282 INFO L225 Difference]: With dead ends: 3883 [2020-02-10 20:40:42,282 INFO L226 Difference]: Without dead ends: 3883 [2020-02-10 20:40:42,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2020-02-10 20:40:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2020-02-10 20:40:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3883 states. [2020-02-10 20:40:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 18511 transitions. [2020-02-10 20:40:42,973 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 18511 transitions. Word has length 28 [2020-02-10 20:40:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,974 INFO L479 AbstractCegarLoop]: Abstraction has 3883 states and 18511 transitions. [2020-02-10 20:40:42,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 18511 transitions. [2020-02-10 20:40:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:42,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,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] [2020-02-10 20:40:42,983 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1461842622, now seen corresponding path program 1 times [2020-02-10 20:40:42,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257218823] [2020-02-10 20:40:42,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257218823] [2020-02-10 20:40:43,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:43,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581277363] [2020-02-10 20:40:43,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:43,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:43,007 INFO L87 Difference]: Start difference. First operand 3883 states and 18511 transitions. Second operand 3 states. [2020-02-10 20:40:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,035 INFO L93 Difference]: Finished difference Result 2539 states and 11503 transitions. [2020-02-10 20:40:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:43,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,043 INFO L225 Difference]: With dead ends: 2539 [2020-02-10 20:40:43,043 INFO L226 Difference]: Without dead ends: 2539 [2020-02-10 20:40:43,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2020-02-10 20:40:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2020-02-10 20:40:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2020-02-10 20:40:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 11503 transitions. [2020-02-10 20:40:43,150 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 11503 transitions. Word has length 28 [2020-02-10 20:40:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,150 INFO L479 AbstractCegarLoop]: Abstraction has 2539 states and 11503 transitions. [2020-02-10 20:40:43,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 11503 transitions. [2020-02-10 20:40:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:43,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,157 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1283995022, now seen corresponding path program 1 times [2020-02-10 20:40:43,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888612394] [2020-02-10 20:40:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888612394] [2020-02-10 20:40:43,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:43,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382731058] [2020-02-10 20:40:43,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:43,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:43,184 INFO L87 Difference]: Start difference. First operand 2539 states and 11503 transitions. Second operand 3 states. [2020-02-10 20:40:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,206 INFO L93 Difference]: Finished difference Result 1535 states and 6913 transitions. [2020-02-10 20:40:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:43,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 20:40:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,211 INFO L225 Difference]: With dead ends: 1535 [2020-02-10 20:40:43,211 INFO L226 Difference]: Without dead ends: 1535 [2020-02-10 20:40:43,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2020-02-10 20:40:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2020-02-10 20:40:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2020-02-10 20:40:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 6913 transitions. [2020-02-10 20:40:43,299 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 6913 transitions. Word has length 28 [2020-02-10 20:40:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,300 INFO L479 AbstractCegarLoop]: Abstraction has 1535 states and 6913 transitions. [2020-02-10 20:40:43,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 6913 transitions. [2020-02-10 20:40:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:43,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,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] [2020-02-10 20:40:43,304 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash 662697718, now seen corresponding path program 1 times [2020-02-10 20:40:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189839428] [2020-02-10 20:40:43,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,854 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:40:44,067 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:40:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189839428] [2020-02-10 20:40:44,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:44,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984907082] [2020-02-10 20:40:44,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:44,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:44,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:44,189 INFO L87 Difference]: Start difference. First operand 1535 states and 6913 transitions. Second operand 11 states. [2020-02-10 20:40:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,417 INFO L93 Difference]: Finished difference Result 3001 states and 11928 transitions. [2020-02-10 20:40:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:44,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,425 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:40:44,425 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:40:44,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:40:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1583. [2020-02-10 20:40:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:40:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7118 transitions. [2020-02-10 20:40:44,530 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7118 transitions. Word has length 28 [2020-02-10 20:40:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,530 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7118 transitions. [2020-02-10 20:40:44,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7118 transitions. [2020-02-10 20:40:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:44,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,535 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1407400216, now seen corresponding path program 2 times [2020-02-10 20:40:44,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991720448] [2020-02-10 20:40:44,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991720448] [2020-02-10 20:40:45,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:45,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706772411] [2020-02-10 20:40:45,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:45,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:45,209 INFO L87 Difference]: Start difference. First operand 1583 states and 7118 transitions. Second operand 11 states. [2020-02-10 20:40:45,560 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-02-10 20:40:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,579 INFO L93 Difference]: Finished difference Result 3002 states and 11925 transitions. [2020-02-10 20:40:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:45,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,586 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 20:40:45,586 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:40:45,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:40:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1578. [2020-02-10 20:40:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:40:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7104 transitions. [2020-02-10 20:40:45,675 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7104 transitions. Word has length 28 [2020-02-10 20:40:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,675 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7104 transitions. [2020-02-10 20:40:45,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7104 transitions. [2020-02-10 20:40:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:45,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,680 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2021328620, now seen corresponding path program 3 times [2020-02-10 20:40:45,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904962839] [2020-02-10 20:40:45,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,177 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:40:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904962839] [2020-02-10 20:40:46,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:46,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440836359] [2020-02-10 20:40:46,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:46,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:46,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:46,301 INFO L87 Difference]: Start difference. First operand 1578 states and 7104 transitions. Second operand 11 states. [2020-02-10 20:40:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,509 INFO L93 Difference]: Finished difference Result 3006 states and 11932 transitions. [2020-02-10 20:40:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:46,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,517 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:40:46,517 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:40:46,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:40:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1584. [2020-02-10 20:40:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:40:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7115 transitions. [2020-02-10 20:40:46,598 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7115 transitions. Word has length 28 [2020-02-10 20:40:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,598 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7115 transitions. [2020-02-10 20:40:46,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7115 transitions. [2020-02-10 20:40:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:46,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,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] [2020-02-10 20:40:46,602 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash -531923624, now seen corresponding path program 4 times [2020-02-10 20:40:46,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13359405] [2020-02-10 20:40:46,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,226 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:40:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13359405] [2020-02-10 20:40:47,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:47,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405460214] [2020-02-10 20:40:47,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:47,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:47,236 INFO L87 Difference]: Start difference. First operand 1584 states and 7115 transitions. Second operand 11 states. [2020-02-10 20:40:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,439 INFO L93 Difference]: Finished difference Result 3011 states and 11936 transitions. [2020-02-10 20:40:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:47,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,447 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 20:40:47,448 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:40:47,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:40:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1578. [2020-02-10 20:40:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:40:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7098 transitions. [2020-02-10 20:40:47,547 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7098 transitions. Word has length 28 [2020-02-10 20:40:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,547 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7098 transitions. [2020-02-10 20:40:47,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7098 transitions. [2020-02-10 20:40:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:47,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:47,552 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash 334314836, now seen corresponding path program 5 times [2020-02-10 20:40:47,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829113031] [2020-02-10 20:40:47,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:48,137 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:40:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:48,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829113031] [2020-02-10 20:40:48,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:48,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332746867] [2020-02-10 20:40:48,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:48,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:48,149 INFO L87 Difference]: Start difference. First operand 1578 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:40:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:48,356 INFO L93 Difference]: Finished difference Result 3009 states and 11933 transitions. [2020-02-10 20:40:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:48,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:48,366 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:40:48,366 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:40:48,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:40:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1585. [2020-02-10 20:40:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:40:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7111 transitions. [2020-02-10 20:40:48,472 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7111 transitions. Word has length 28 [2020-02-10 20:40:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:48,473 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7111 transitions. [2020-02-10 20:40:48,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7111 transitions. [2020-02-10 20:40:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:48,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:48,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:48,477 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1079017334, now seen corresponding path program 6 times [2020-02-10 20:40:48,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:48,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408814231] [2020-02-10 20:40:48,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:49,162 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:40:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:49,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408814231] [2020-02-10 20:40:49,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:49,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:49,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058282062] [2020-02-10 20:40:49,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:49,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:49,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:49,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:49,173 INFO L87 Difference]: Start difference. First operand 1585 states and 7111 transitions. Second operand 11 states. [2020-02-10 20:40:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:49,336 INFO L93 Difference]: Finished difference Result 3013 states and 11934 transitions. [2020-02-10 20:40:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:49,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:49,344 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:40:49,344 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 20:40:49,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 20:40:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1572. [2020-02-10 20:40:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:40:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7081 transitions. [2020-02-10 20:40:49,430 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7081 transitions. Word has length 28 [2020-02-10 20:40:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:49,431 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7081 transitions. [2020-02-10 20:40:49,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7081 transitions. [2020-02-10 20:40:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:49,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:49,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] [2020-02-10 20:40:49,434 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1382710192, now seen corresponding path program 7 times [2020-02-10 20:40:49,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:49,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803761853] [2020-02-10 20:40:49,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:50,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803761853] [2020-02-10 20:40:50,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:50,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:50,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548576242] [2020-02-10 20:40:50,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:50,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:50,048 INFO L87 Difference]: Start difference. First operand 1572 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:40:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:50,268 INFO L93 Difference]: Finished difference Result 2996 states and 11912 transitions. [2020-02-10 20:40:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:50,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:50,276 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:40:50,277 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:40:50,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:40:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1582. [2020-02-10 20:40:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:40:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7109 transitions. [2020-02-10 20:40:50,353 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7109 transitions. Word has length 28 [2020-02-10 20:40:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:50,353 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7109 transitions. [2020-02-10 20:40:50,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7109 transitions. [2020-02-10 20:40:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:50,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:50,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] [2020-02-10 20:40:50,357 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2127412690, now seen corresponding path program 8 times [2020-02-10 20:40:50,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:50,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773948307] [2020-02-10 20:40:50,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:50,924 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:40:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:50,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773948307] [2020-02-10 20:40:50,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:50,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:50,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877130742] [2020-02-10 20:40:50,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:50,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:50,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:50,933 INFO L87 Difference]: Start difference. First operand 1582 states and 7109 transitions. Second operand 11 states. [2020-02-10 20:40:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:51,141 INFO L93 Difference]: Finished difference Result 2997 states and 11909 transitions. [2020-02-10 20:40:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:51,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:51,149 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:40:51,149 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:40:51,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:40:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1577. [2020-02-10 20:40:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:40:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7095 transitions. [2020-02-10 20:40:51,227 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7095 transitions. Word has length 28 [2020-02-10 20:40:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:51,228 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7095 transitions. [2020-02-10 20:40:51,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7095 transitions. [2020-02-10 20:40:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:51,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:51,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] [2020-02-10 20:40:51,232 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 309624812, now seen corresponding path program 9 times [2020-02-10 20:40:51,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:51,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581166046] [2020-02-10 20:40:51,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:51,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581166046] [2020-02-10 20:40:51,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:51,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:51,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64773417] [2020-02-10 20:40:51,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:51,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:51,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:51,810 INFO L87 Difference]: Start difference. First operand 1577 states and 7095 transitions. Second operand 11 states. [2020-02-10 20:40:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:52,048 INFO L93 Difference]: Finished difference Result 2998 states and 11911 transitions. [2020-02-10 20:40:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:52,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:52,057 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:40:52,057 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:40:52,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:40:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1582. [2020-02-10 20:40:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:40:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7104 transitions. [2020-02-10 20:40:52,146 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7104 transitions. Word has length 28 [2020-02-10 20:40:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:52,146 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7104 transitions. [2020-02-10 20:40:52,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7104 transitions. [2020-02-10 20:40:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:52,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:52,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] [2020-02-10 20:40:52,151 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1751234990, now seen corresponding path program 10 times [2020-02-10 20:40:52,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:52,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979397605] [2020-02-10 20:40:52,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:52,699 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:40:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:52,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979397605] [2020-02-10 20:40:52,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:52,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:52,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828673574] [2020-02-10 20:40:52,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:52,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:52,708 INFO L87 Difference]: Start difference. First operand 1582 states and 7104 transitions. Second operand 11 states. [2020-02-10 20:40:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:52,920 INFO L93 Difference]: Finished difference Result 3001 states and 11912 transitions. [2020-02-10 20:40:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:52,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:52,927 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:40:52,927 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:40:52,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:40:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1577. [2020-02-10 20:40:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:40:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7090 transitions. [2020-02-10 20:40:52,999 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7090 transitions. Word has length 28 [2020-02-10 20:40:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,000 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7090 transitions. [2020-02-10 20:40:53,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7090 transitions. [2020-02-10 20:40:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:53,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:53,003 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1629699028, now seen corresponding path program 11 times [2020-02-10 20:40:53,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079642421] [2020-02-10 20:40:53,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,575 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:40:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079642421] [2020-02-10 20:40:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:53,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150826482] [2020-02-10 20:40:53,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:53,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:53,586 INFO L87 Difference]: Start difference. First operand 1577 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:40:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:53,788 INFO L93 Difference]: Finished difference Result 3001 states and 11913 transitions. [2020-02-10 20:40:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:53,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:53,796 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:40:53,796 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:40:53,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:40:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 20:40:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:40:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7101 transitions. [2020-02-10 20:40:53,868 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7101 transitions. Word has length 28 [2020-02-10 20:40:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,868 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7101 transitions. [2020-02-10 20:40:53,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7101 transitions. [2020-02-10 20:40:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:53,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:53,872 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash -140294032, now seen corresponding path program 12 times [2020-02-10 20:40:53,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100014188] [2020-02-10 20:40:53,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:54,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100014188] [2020-02-10 20:40:54,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:54,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:54,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413963620] [2020-02-10 20:40:54,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:54,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:54,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:54,465 INFO L87 Difference]: Start difference. First operand 1583 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:40:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:54,672 INFO L93 Difference]: Finished difference Result 3003 states and 11911 transitions. [2020-02-10 20:40:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:54,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:54,680 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:40:54,680 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:40:54,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:40:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1572. [2020-02-10 20:40:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:40:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7076 transitions. [2020-02-10 20:40:54,749 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7076 transitions. Word has length 28 [2020-02-10 20:40:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:54,749 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7076 transitions. [2020-02-10 20:40:54,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7076 transitions. [2020-02-10 20:40:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:54,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:54,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] [2020-02-10 20:40:54,752 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1393213296, now seen corresponding path program 13 times [2020-02-10 20:40:54,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:54,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298355197] [2020-02-10 20:40:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:55,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298355197] [2020-02-10 20:40:55,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:55,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:55,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796553765] [2020-02-10 20:40:55,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:55,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:55,314 INFO L87 Difference]: Start difference. First operand 1572 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:40:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:55,557 INFO L93 Difference]: Finished difference Result 3012 states and 11939 transitions. [2020-02-10 20:40:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:55,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:55,566 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:40:55,566 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 20:40:55,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 20:40:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1585. [2020-02-10 20:40:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:40:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7111 transitions. [2020-02-10 20:40:55,647 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7111 transitions. Word has length 28 [2020-02-10 20:40:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:55,647 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7111 transitions. [2020-02-10 20:40:55,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7111 transitions. [2020-02-10 20:40:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:55,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:55,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:55,651 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1412349004, now seen corresponding path program 14 times [2020-02-10 20:40:55,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:55,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131620146] [2020-02-10 20:40:55,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:56,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131620146] [2020-02-10 20:40:56,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:56,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:56,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164763385] [2020-02-10 20:40:56,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:56,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:56,229 INFO L87 Difference]: Start difference. First operand 1585 states and 7111 transitions. Second operand 11 states. [2020-02-10 20:40:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:56,435 INFO L93 Difference]: Finished difference Result 3017 states and 11943 transitions. [2020-02-10 20:40:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:56,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:56,443 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 20:40:56,443 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:40:56,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:40:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1579. [2020-02-10 20:40:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:40:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7094 transitions. [2020-02-10 20:40:56,513 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7094 transitions. Word has length 28 [2020-02-10 20:40:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:56,513 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7094 transitions. [2020-02-10 20:40:56,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7094 transitions. [2020-02-10 20:40:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:56,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:56,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:56,516 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1290813042, now seen corresponding path program 15 times [2020-02-10 20:40:56,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:56,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969270437] [2020-02-10 20:40:56,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969270437] [2020-02-10 20:40:57,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:57,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431918900] [2020-02-10 20:40:57,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:57,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:57,096 INFO L87 Difference]: Start difference. First operand 1579 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:40:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:57,328 INFO L93 Difference]: Finished difference Result 3009 states and 11928 transitions. [2020-02-10 20:40:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:57,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:57,336 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:40:57,336 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:40:57,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:40:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1584. [2020-02-10 20:40:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:40:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7103 transitions. [2020-02-10 20:40:57,404 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7103 transitions. Word has length 28 [2020-02-10 20:40:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:57,405 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7103 transitions. [2020-02-10 20:40:57,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7103 transitions. [2020-02-10 20:40:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:57,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:57,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] [2020-02-10 20:40:57,407 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 943294452, now seen corresponding path program 16 times [2020-02-10 20:40:57,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:57,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46252474] [2020-02-10 20:40:57,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46252474] [2020-02-10 20:40:57,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:57,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705096158] [2020-02-10 20:40:57,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:57,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:57,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:57,971 INFO L87 Difference]: Start difference. First operand 1584 states and 7103 transitions. Second operand 11 states. [2020-02-10 20:40:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:58,183 INFO L93 Difference]: Finished difference Result 3012 states and 11929 transitions. [2020-02-10 20:40:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:58,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:58,191 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:40:58,191 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:40:58,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:40:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1579. [2020-02-10 20:40:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:40:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7089 transitions. [2020-02-10 20:40:58,259 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7089 transitions. Word has length 28 [2020-02-10 20:40:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:58,259 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7089 transitions. [2020-02-10 20:40:58,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7089 transitions. [2020-02-10 20:40:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:58,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:58,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] [2020-02-10 20:40:58,261 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -874493426, now seen corresponding path program 17 times [2020-02-10 20:40:58,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:58,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43596447] [2020-02-10 20:40:58,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:58,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43596447] [2020-02-10 20:40:58,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:58,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:58,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415210189] [2020-02-10 20:40:58,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:58,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:58,882 INFO L87 Difference]: Start difference. First operand 1579 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:40:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:59,179 INFO L93 Difference]: Finished difference Result 3024 states and 11953 transitions. [2020-02-10 20:40:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:40:59,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:40:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:59,190 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 20:40:59,190 INFO L226 Difference]: Without dead ends: 3004 [2020-02-10 20:40:59,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:40:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2020-02-10 20:40:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1589. [2020-02-10 20:40:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:40:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7106 transitions. [2020-02-10 20:40:59,260 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7106 transitions. Word has length 28 [2020-02-10 20:40:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:59,260 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7106 transitions. [2020-02-10 20:40:59,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:40:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7106 transitions. [2020-02-10 20:40:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:40:59,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:59,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:59,263 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:59,263 INFO L82 PathProgramCache]: Analyzing trace with hash -129790928, now seen corresponding path program 18 times [2020-02-10 20:40:59,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:59,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567024294] [2020-02-10 20:40:59,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:59,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567024294] [2020-02-10 20:40:59,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:59,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:40:59,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507795066] [2020-02-10 20:40:59,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:40:59,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:59,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:40:59,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:59,804 INFO L87 Difference]: Start difference. First operand 1589 states and 7106 transitions. Second operand 11 states. [2020-02-10 20:41:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,011 INFO L93 Difference]: Finished difference Result 3022 states and 11941 transitions. [2020-02-10 20:41:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:00,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,019 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:41:00,019 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:41:00,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:41:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1572. [2020-02-10 20:41:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:41:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7069 transitions. [2020-02-10 20:41:00,087 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7069 transitions. Word has length 28 [2020-02-10 20:41:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,087 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7069 transitions. [2020-02-10 20:41:00,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7069 transitions. [2020-02-10 20:41:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:00,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:00,089 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2146548398, now seen corresponding path program 19 times [2020-02-10 20:41:00,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416226638] [2020-02-10 20:41:00,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,644 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:41:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416226638] [2020-02-10 20:41:00,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:00,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910042151] [2020-02-10 20:41:00,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:00,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:00,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:00,652 INFO L87 Difference]: Start difference. First operand 1572 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:41:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,858 INFO L93 Difference]: Finished difference Result 3019 states and 11951 transitions. [2020-02-10 20:41:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:00,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,866 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 20:41:00,867 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 20:41:00,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 20:41:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1587. [2020-02-10 20:41:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:41:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7110 transitions. [2020-02-10 20:41:00,934 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7110 transitions. Word has length 28 [2020-02-10 20:41:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,934 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7110 transitions. [2020-02-10 20:41:00,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7110 transitions. [2020-02-10 20:41:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:00,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:00,937 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1401845900, now seen corresponding path program 20 times [2020-02-10 20:41:00,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429924207] [2020-02-10 20:41:00,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:01,538 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:41:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:01,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429924207] [2020-02-10 20:41:01,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:01,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:01,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360133566] [2020-02-10 20:41:01,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:01,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:01,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:01,547 INFO L87 Difference]: Start difference. First operand 1587 states and 7110 transitions. Second operand 11 states. [2020-02-10 20:41:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:01,721 INFO L93 Difference]: Finished difference Result 3023 states and 11952 transitions. [2020-02-10 20:41:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:01,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:01,729 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:41:01,730 INFO L226 Difference]: Without dead ends: 2996 [2020-02-10 20:41:01,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2020-02-10 20:41:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 1580. [2020-02-10 20:41:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 20:41:01,798 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 20:41:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:01,798 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 20:41:01,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 20:41:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:01,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:01,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:01,801 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash -535607440, now seen corresponding path program 21 times [2020-02-10 20:41:01,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:01,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020625473] [2020-02-10 20:41:01,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:02,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020625473] [2020-02-10 20:41:02,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:02,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:02,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926233015] [2020-02-10 20:41:02,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:02,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:02,317 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:41:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:02,572 INFO L93 Difference]: Finished difference Result 3016 states and 11939 transitions. [2020-02-10 20:41:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:02,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:02,580 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 20:41:02,580 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:41:02,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:41:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1586. [2020-02-10 20:41:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:41:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7101 transitions. [2020-02-10 20:41:02,716 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7101 transitions. Word has length 28 [2020-02-10 20:41:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:02,716 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7101 transitions. [2020-02-10 20:41:02,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7101 transitions. [2020-02-10 20:41:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:02,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:02,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] [2020-02-10 20:41:02,720 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash 953797556, now seen corresponding path program 22 times [2020-02-10 20:41:02,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:02,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688711134] [2020-02-10 20:41:02,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:03,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688711134] [2020-02-10 20:41:03,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:03,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:03,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149369344] [2020-02-10 20:41:03,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:03,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:03,287 INFO L87 Difference]: Start difference. First operand 1586 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:41:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:03,477 INFO L93 Difference]: Finished difference Result 3018 states and 11937 transitions. [2020-02-10 20:41:03,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:03,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:03,485 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 20:41:03,485 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:41:03,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:41:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1580. [2020-02-10 20:41:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7084 transitions. [2020-02-10 20:41:03,554 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7084 transitions. Word has length 28 [2020-02-10 20:41:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:03,555 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7084 transitions. [2020-02-10 20:41:03,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7084 transitions. [2020-02-10 20:41:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:03,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:03,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] [2020-02-10 20:41:03,557 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036016, now seen corresponding path program 23 times [2020-02-10 20:41:03,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:03,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68061909] [2020-02-10 20:41:03,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,144 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:41:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68061909] [2020-02-10 20:41:04,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:04,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048842277] [2020-02-10 20:41:04,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:04,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:04,153 INFO L87 Difference]: Start difference. First operand 1580 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:41:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:04,306 INFO L93 Difference]: Finished difference Result 3028 states and 11956 transitions. [2020-02-10 20:41:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:04,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:04,314 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 20:41:04,315 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:41:04,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:41:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1590. [2020-02-10 20:41:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:41:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7101 transitions. [2020-02-10 20:41:04,383 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7101 transitions. Word has length 28 [2020-02-10 20:41:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:04,383 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7101 transitions. [2020-02-10 20:41:04,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7101 transitions. [2020-02-10 20:41:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:04,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:04,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:04,386 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1730228782, now seen corresponding path program 24 times [2020-02-10 20:41:04,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:04,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815672142] [2020-02-10 20:41:04,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815672142] [2020-02-10 20:41:04,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:04,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754096932] [2020-02-10 20:41:04,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:04,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:04,988 INFO L87 Difference]: Start difference. First operand 1590 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:41:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:05,220 INFO L93 Difference]: Finished difference Result 3026 states and 11944 transitions. [2020-02-10 20:41:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:05,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:05,228 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:41:05,228 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:41:05,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:41:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1565. [2020-02-10 20:41:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:41:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7049 transitions. [2020-02-10 20:41:05,296 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7049 transitions. Word has length 28 [2020-02-10 20:41:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:05,296 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7049 transitions. [2020-02-10 20:41:05,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7049 transitions. [2020-02-10 20:41:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:05,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:05,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:05,298 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash 582955646, now seen corresponding path program 25 times [2020-02-10 20:41:05,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:05,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793647227] [2020-02-10 20:41:05,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793647227] [2020-02-10 20:41:05,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:05,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154972425] [2020-02-10 20:41:05,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:05,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:05,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:05,864 INFO L87 Difference]: Start difference. First operand 1565 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:41:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,108 INFO L93 Difference]: Finished difference Result 2995 states and 11908 transitions. [2020-02-10 20:41:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:06,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,115 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:41:06,115 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 20:41:06,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 20:41:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1582. [2020-02-10 20:41:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:41:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7108 transitions. [2020-02-10 20:41:06,182 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7108 transitions. Word has length 28 [2020-02-10 20:41:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,183 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7108 transitions. [2020-02-10 20:41:06,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7108 transitions. [2020-02-10 20:41:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:06,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:06,186 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1327658144, now seen corresponding path program 26 times [2020-02-10 20:41:06,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247209335] [2020-02-10 20:41:06,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:06,656 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 20:41:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:06,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247209335] [2020-02-10 20:41:06,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:06,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:06,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778370788] [2020-02-10 20:41:06,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:06,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:06,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:06,872 INFO L87 Difference]: Start difference. First operand 1582 states and 7108 transitions. Second operand 11 states. [2020-02-10 20:41:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:07,056 INFO L93 Difference]: Finished difference Result 2996 states and 11905 transitions. [2020-02-10 20:41:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:07,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:07,064 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:41:07,064 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:41:07,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:41:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1577. [2020-02-10 20:41:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:41:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7094 transitions. [2020-02-10 20:41:07,137 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7094 transitions. Word has length 28 [2020-02-10 20:41:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:07,137 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7094 transitions. [2020-02-10 20:41:07,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7094 transitions. [2020-02-10 20:41:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:07,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:07,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:07,141 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2101070692, now seen corresponding path program 27 times [2020-02-10 20:41:07,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:07,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696638569] [2020-02-10 20:41:07,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:07,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696638569] [2020-02-10 20:41:07,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:07,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:07,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692691818] [2020-02-10 20:41:07,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:07,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:07,718 INFO L87 Difference]: Start difference. First operand 1577 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:41:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:07,947 INFO L93 Difference]: Finished difference Result 3000 states and 11912 transitions. [2020-02-10 20:41:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:07,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:07,956 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:41:07,956 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:41:07,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:41:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 20:41:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:41:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7105 transitions. [2020-02-10 20:41:08,071 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7105 transitions. Word has length 28 [2020-02-10 20:41:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,071 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7105 transitions. [2020-02-10 20:41:08,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7105 transitions. [2020-02-10 20:41:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:08,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,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] [2020-02-10 20:41:08,075 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:08,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash -611665696, now seen corresponding path program 28 times [2020-02-10 20:41:08,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80839317] [2020-02-10 20:41:08,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:08,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80839317] [2020-02-10 20:41:08,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:08,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:08,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87416877] [2020-02-10 20:41:08,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:08,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:08,641 INFO L87 Difference]: Start difference. First operand 1583 states and 7105 transitions. Second operand 11 states. [2020-02-10 20:41:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:08,828 INFO L93 Difference]: Finished difference Result 3005 states and 11916 transitions. [2020-02-10 20:41:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:08,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:08,836 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:41:08,836 INFO L226 Difference]: Without dead ends: 2979 [2020-02-10 20:41:08,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2020-02-10 20:41:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 1577. [2020-02-10 20:41:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:41:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7088 transitions. [2020-02-10 20:41:08,906 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7088 transitions. Word has length 28 [2020-02-10 20:41:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,906 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7088 transitions. [2020-02-10 20:41:08,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7088 transitions. [2020-02-10 20:41:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:08,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,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] [2020-02-10 20:41:08,909 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 254572764, now seen corresponding path program 29 times [2020-02-10 20:41:08,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79743025] [2020-02-10 20:41:08,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:09,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79743025] [2020-02-10 20:41:09,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:09,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:09,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697621160] [2020-02-10 20:41:09,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:09,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:09,463 INFO L87 Difference]: Start difference. First operand 1577 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:41:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:09,651 INFO L93 Difference]: Finished difference Result 3003 states and 11913 transitions. [2020-02-10 20:41:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:09,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:09,659 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:41:09,659 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:41:09,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:41:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1584. [2020-02-10 20:41:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:41:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7101 transitions. [2020-02-10 20:41:09,727 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7101 transitions. Word has length 28 [2020-02-10 20:41:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:09,727 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7101 transitions. [2020-02-10 20:41:09,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7101 transitions. [2020-02-10 20:41:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:09,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:09,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:09,730 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash 999275262, now seen corresponding path program 30 times [2020-02-10 20:41:09,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:09,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835119651] [2020-02-10 20:41:09,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835119651] [2020-02-10 20:41:10,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:10,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237791543] [2020-02-10 20:41:10,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:10,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:10,293 INFO L87 Difference]: Start difference. First operand 1584 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:41:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,471 INFO L93 Difference]: Finished difference Result 3007 states and 11914 transitions. [2020-02-10 20:41:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:10,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,479 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:41:10,480 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:41:10,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:41:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1571. [2020-02-10 20:41:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:41:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7071 transitions. [2020-02-10 20:41:10,553 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7071 transitions. Word has length 28 [2020-02-10 20:41:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,554 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7071 transitions. [2020-02-10 20:41:10,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7071 transitions. [2020-02-10 20:41:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:10,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,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] [2020-02-10 20:41:10,557 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash -242257480, now seen corresponding path program 31 times [2020-02-10 20:41:10,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029674532] [2020-02-10 20:41:10,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:11,256 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:41:11,415 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 20:41:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:11,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029674532] [2020-02-10 20:41:11,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:11,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:11,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786498163] [2020-02-10 20:41:11,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:11,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:11,428 INFO L87 Difference]: Start difference. First operand 1571 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:41:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:11,624 INFO L93 Difference]: Finished difference Result 2989 states and 11890 transitions. [2020-02-10 20:41:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:11,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:11,632 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:41:11,632 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:41:11,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:41:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1581. [2020-02-10 20:41:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:41:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7099 transitions. [2020-02-10 20:41:11,715 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7099 transitions. Word has length 28 [2020-02-10 20:41:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:11,715 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7099 transitions. [2020-02-10 20:41:11,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7099 transitions. [2020-02-10 20:41:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:11,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:11,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:11,718 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:11,718 INFO L82 PathProgramCache]: Analyzing trace with hash 502445018, now seen corresponding path program 32 times [2020-02-10 20:41:11,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:11,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374616786] [2020-02-10 20:41:11,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374616786] [2020-02-10 20:41:12,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:12,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062167109] [2020-02-10 20:41:12,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:12,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:12,312 INFO L87 Difference]: Start difference. First operand 1581 states and 7099 transitions. Second operand 11 states. [2020-02-10 20:41:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,491 INFO L93 Difference]: Finished difference Result 2990 states and 11887 transitions. [2020-02-10 20:41:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:12,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,499 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:41:12,499 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:41:12,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:41:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1576. [2020-02-10 20:41:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:41:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7085 transitions. [2020-02-10 20:41:12,579 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7085 transitions. Word has length 28 [2020-02-10 20:41:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,580 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7085 transitions. [2020-02-10 20:41:12,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7085 transitions. [2020-02-10 20:41:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:12,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,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] [2020-02-10 20:41:12,583 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1850572662, now seen corresponding path program 33 times [2020-02-10 20:41:12,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73707459] [2020-02-10 20:41:12,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73707459] [2020-02-10 20:41:13,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:13,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913535070] [2020-02-10 20:41:13,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:13,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:13,127 INFO L87 Difference]: Start difference. First operand 1576 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:41:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:13,359 INFO L93 Difference]: Finished difference Result 2990 states and 11887 transitions. [2020-02-10 20:41:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:13,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:13,366 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:41:13,366 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:41:13,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:41:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1581. [2020-02-10 20:41:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:41:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7094 transitions. [2020-02-10 20:41:13,433 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7094 transitions. Word has length 28 [2020-02-10 20:41:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:13,433 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7094 transitions. [2020-02-10 20:41:13,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7094 transitions. [2020-02-10 20:41:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:13,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:13,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] [2020-02-10 20:41:13,436 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash -187919974, now seen corresponding path program 34 times [2020-02-10 20:41:13,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:13,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617779470] [2020-02-10 20:41:13,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617779470] [2020-02-10 20:41:13,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:13,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665060455] [2020-02-10 20:41:13,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:13,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:13,963 INFO L87 Difference]: Start difference. First operand 1581 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:41:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,149 INFO L93 Difference]: Finished difference Result 2992 states and 11886 transitions. [2020-02-10 20:41:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:14,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,158 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:41:14,158 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:41:14,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:41:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1576. [2020-02-10 20:41:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:41:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7080 transitions. [2020-02-10 20:41:14,225 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7080 transitions. Word has length 28 [2020-02-10 20:41:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,225 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7080 transitions. [2020-02-10 20:41:14,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7080 transitions. [2020-02-10 20:41:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:14,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,228 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:14,228 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:14,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 505070794, now seen corresponding path program 35 times [2020-02-10 20:41:14,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99109066] [2020-02-10 20:41:14,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:14,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99109066] [2020-02-10 20:41:14,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:14,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:14,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693012177] [2020-02-10 20:41:14,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:14,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:14,821 INFO L87 Difference]: Start difference. First operand 1576 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:41:15,051 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-02-10 20:41:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:15,068 INFO L93 Difference]: Finished difference Result 2993 states and 11889 transitions. [2020-02-10 20:41:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:15,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:15,075 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:41:15,076 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:41:15,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:41:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1582. [2020-02-10 20:41:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:41:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7091 transitions. [2020-02-10 20:41:15,142 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7091 transitions. Word has length 28 [2020-02-10 20:41:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:15,142 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7091 transitions. [2020-02-10 20:41:15,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7091 transitions. [2020-02-10 20:41:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:15,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:15,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] [2020-02-10 20:41:15,146 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1423020984, now seen corresponding path program 36 times [2020-02-10 20:41:15,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:15,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484747996] [2020-02-10 20:41:15,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:15,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484747996] [2020-02-10 20:41:15,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:15,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:15,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931802310] [2020-02-10 20:41:15,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:15,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:15,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:15,712 INFO L87 Difference]: Start difference. First operand 1582 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:41:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:16,019 INFO L93 Difference]: Finished difference Result 2994 states and 11885 transitions. [2020-02-10 20:41:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:16,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:16,025 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:41:16,025 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:41:16,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:41:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1571. [2020-02-10 20:41:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:41:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7066 transitions. [2020-02-10 20:41:16,093 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7066 transitions. Word has length 28 [2020-02-10 20:41:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:16,093 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7066 transitions. [2020-02-10 20:41:16,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7066 transitions. [2020-02-10 20:41:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:16,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:16,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:16,096 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash -231754376, now seen corresponding path program 37 times [2020-02-10 20:41:16,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:16,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115566740] [2020-02-10 20:41:16,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:16,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115566740] [2020-02-10 20:41:16,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:16,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:16,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119818439] [2020-02-10 20:41:16,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:16,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:16,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:16,675 INFO L87 Difference]: Start difference. First operand 1571 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:41:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:16,940 INFO L93 Difference]: Finished difference Result 3002 states and 11911 transitions. [2020-02-10 20:41:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:16,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:16,948 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 20:41:16,948 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:41:16,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:41:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1583. [2020-02-10 20:41:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:41:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7099 transitions. [2020-02-10 20:41:17,016 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7099 transitions. Word has length 28 [2020-02-10 20:41:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,016 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7099 transitions. [2020-02-10 20:41:17,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7099 transitions. [2020-02-10 20:41:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:17,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:17,019 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1257650620, now seen corresponding path program 38 times [2020-02-10 20:41:17,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423593481] [2020-02-10 20:41:17,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:17,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423593481] [2020-02-10 20:41:17,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:17,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:17,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534344742] [2020-02-10 20:41:17,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:17,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:17,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:17,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:17,564 INFO L87 Difference]: Start difference. First operand 1583 states and 7099 transitions. Second operand 11 states. [2020-02-10 20:41:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:17,719 INFO L93 Difference]: Finished difference Result 3007 states and 11915 transitions. [2020-02-10 20:41:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:17,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:17,727 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:41:17,727 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:41:17,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:41:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1577. [2020-02-10 20:41:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:41:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7082 transitions. [2020-02-10 20:41:17,795 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7082 transitions. Word has length 28 [2020-02-10 20:41:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,795 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7082 transitions. [2020-02-10 20:41:17,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7082 transitions. [2020-02-10 20:41:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:17,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:17,798 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash 843956780, now seen corresponding path program 39 times [2020-02-10 20:41:17,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732446107] [2020-02-10 20:41:17,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732446107] [2020-02-10 20:41:18,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:18,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633647902] [2020-02-10 20:41:18,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:18,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:18,366 INFO L87 Difference]: Start difference. First operand 1577 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:41:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,566 INFO L93 Difference]: Finished difference Result 2998 states and 11898 transitions. [2020-02-10 20:41:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:18,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,573 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:41:18,573 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:41:18,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:41:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1582. [2020-02-10 20:41:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:41:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7091 transitions. [2020-02-10 20:41:18,644 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7091 transitions. Word has length 28 [2020-02-10 20:41:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:18,644 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7091 transitions. [2020-02-10 20:41:18,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7091 transitions. [2020-02-10 20:41:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:18,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:18,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:18,647 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1788357828, now seen corresponding path program 40 times [2020-02-10 20:41:18,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:18,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284553911] [2020-02-10 20:41:18,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:19,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284553911] [2020-02-10 20:41:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:19,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656874866] [2020-02-10 20:41:19,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:19,238 INFO L87 Difference]: Start difference. First operand 1582 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:41:19,480 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-02-10 20:41:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:19,496 INFO L93 Difference]: Finished difference Result 3000 states and 11897 transitions. [2020-02-10 20:41:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:19,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:19,505 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:41:19,505 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:41:19,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:41:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1577. [2020-02-10 20:41:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:41:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7077 transitions. [2020-02-10 20:41:19,574 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7077 transitions. Word has length 28 [2020-02-10 20:41:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:19,574 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7077 transitions. [2020-02-10 20:41:19,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7077 transitions. [2020-02-10 20:41:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:19,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:19,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] [2020-02-10 20:41:19,577 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:19,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1260276396, now seen corresponding path program 41 times [2020-02-10 20:41:19,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:19,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630316282] [2020-02-10 20:41:19,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630316282] [2020-02-10 20:41:20,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:20,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681057487] [2020-02-10 20:41:20,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:20,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:20,155 INFO L87 Difference]: Start difference. First operand 1577 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:41:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:20,393 INFO L93 Difference]: Finished difference Result 3011 states and 11919 transitions. [2020-02-10 20:41:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:20,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:20,401 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 20:41:20,401 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:41:20,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:41:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1585. [2020-02-10 20:41:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:41:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7091 transitions. [2020-02-10 20:41:20,471 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7091 transitions. Word has length 28 [2020-02-10 20:41:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:20,471 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7091 transitions. [2020-02-10 20:41:20,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7091 transitions. [2020-02-10 20:41:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:20,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:20,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] [2020-02-10 20:41:20,474 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1433524088, now seen corresponding path program 42 times [2020-02-10 20:41:20,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:20,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672296611] [2020-02-10 20:41:20,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,995 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-02-10 20:41:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:21,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672296611] [2020-02-10 20:41:21,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:21,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:21,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668364242] [2020-02-10 20:41:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:21,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:21,108 INFO L87 Difference]: Start difference. First operand 1585 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:41:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,370 INFO L93 Difference]: Finished difference Result 3008 states and 11906 transitions. [2020-02-10 20:41:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:21,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,378 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:41:21,378 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:41:21,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:41:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1571. [2020-02-10 20:41:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:41:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7060 transitions. [2020-02-10 20:41:21,445 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7060 transitions. Word has length 28 [2020-02-10 20:41:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,445 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7060 transitions. [2020-02-10 20:41:21,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7060 transitions. [2020-02-10 20:41:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:21,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,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] [2020-02-10 20:41:21,448 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 523451226, now seen corresponding path program 43 times [2020-02-10 20:41:21,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392229993] [2020-02-10 20:41:21,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392229993] [2020-02-10 20:41:22,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:22,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475972849] [2020-02-10 20:41:22,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:22,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:22,031 INFO L87 Difference]: Start difference. First operand 1571 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:41:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:22,293 INFO L93 Difference]: Finished difference Result 3009 states and 11924 transitions. [2020-02-10 20:41:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:22,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:22,302 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:41:22,302 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:41:22,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:41:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1585. [2020-02-10 20:41:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:41:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7099 transitions. [2020-02-10 20:41:22,369 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7099 transitions. Word has length 28 [2020-02-10 20:41:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:22,369 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7099 transitions. [2020-02-10 20:41:22,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7099 transitions. [2020-02-10 20:41:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:22,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:22,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] [2020-02-10 20:41:22,372 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1268153724, now seen corresponding path program 44 times [2020-02-10 20:41:22,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:22,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196365079] [2020-02-10 20:41:22,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196365079] [2020-02-10 20:41:22,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:22,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125989851] [2020-02-10 20:41:22,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:22,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:22,930 INFO L87 Difference]: Start difference. First operand 1585 states and 7099 transitions. Second operand 11 states. [2020-02-10 20:41:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:23,173 INFO L93 Difference]: Finished difference Result 3013 states and 11925 transitions. [2020-02-10 20:41:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:23,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:23,181 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:41:23,181 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:41:23,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:41:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1578. [2020-02-10 20:41:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:41:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7079 transitions. [2020-02-10 20:41:23,249 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7079 transitions. Word has length 28 [2020-02-10 20:41:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:23,249 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7079 transitions. [2020-02-10 20:41:23,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7079 transitions. [2020-02-10 20:41:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:23,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:23,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:23,251 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1599162382, now seen corresponding path program 45 times [2020-02-10 20:41:23,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:23,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523416263] [2020-02-10 20:41:23,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:23,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523416263] [2020-02-10 20:41:23,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:23,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:23,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812904917] [2020-02-10 20:41:23,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:23,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:23,812 INFO L87 Difference]: Start difference. First operand 1578 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:41:24,046 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-02-10 20:41:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,061 INFO L93 Difference]: Finished difference Result 3005 states and 11910 transitions. [2020-02-10 20:41:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:24,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,069 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:41:24,069 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:41:24,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:41:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1584. [2020-02-10 20:41:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:41:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7090 transitions. [2020-02-10 20:41:24,138 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7090 transitions. Word has length 28 [2020-02-10 20:41:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,138 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7090 transitions. [2020-02-10 20:41:24,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7090 transitions. [2020-02-10 20:41:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:24,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,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] [2020-02-10 20:41:24,140 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1777854724, now seen corresponding path program 46 times [2020-02-10 20:41:24,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845725679] [2020-02-10 20:41:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845725679] [2020-02-10 20:41:24,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:24,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365793000] [2020-02-10 20:41:24,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:24,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:24,696 INFO L87 Difference]: Start difference. First operand 1584 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:41:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,869 INFO L93 Difference]: Finished difference Result 3006 states and 11906 transitions. [2020-02-10 20:41:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:24,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,877 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:41:24,877 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:41:24,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:41:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1578. [2020-02-10 20:41:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:41:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:41:24,953 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:41:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,953 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:41:24,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:41:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:24,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:24,957 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -340161458, now seen corresponding path program 47 times [2020-02-10 20:41:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129873355] [2020-02-10 20:41:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:25,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129873355] [2020-02-10 20:41:25,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:25,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068152746] [2020-02-10 20:41:25,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:25,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:25,507 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:41:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:25,640 INFO L93 Difference]: Finished difference Result 3015 states and 11923 transitions. [2020-02-10 20:41:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:25,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:25,648 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 20:41:25,648 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:41:25,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:41:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1586. [2020-02-10 20:41:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:41:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7087 transitions. [2020-02-10 20:41:25,715 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7087 transitions. Word has length 28 [2020-02-10 20:41:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:25,716 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7087 transitions. [2020-02-10 20:41:25,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7087 transitions. [2020-02-10 20:41:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:25,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:25,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:25,719 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash -166913766, now seen corresponding path program 48 times [2020-02-10 20:41:25,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:25,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350888729] [2020-02-10 20:41:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:26,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350888729] [2020-02-10 20:41:26,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:26,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:26,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193653010] [2020-02-10 20:41:26,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:26,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:26,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:26,272 INFO L87 Difference]: Start difference. First operand 1586 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:41:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,475 INFO L93 Difference]: Finished difference Result 3012 states and 11910 transitions. [2020-02-10 20:41:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:26,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,483 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:41:26,483 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:41:26,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:41:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1565. [2020-02-10 20:41:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:41:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7043 transitions. [2020-02-10 20:41:26,550 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7043 transitions. Word has length 28 [2020-02-10 20:41:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,550 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7043 transitions. [2020-02-10 20:41:26,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7043 transitions. [2020-02-10 20:41:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:26,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,553 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:26,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,553 INFO L82 PathProgramCache]: Analyzing trace with hash 15547412, now seen corresponding path program 49 times [2020-02-10 20:41:26,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777672004] [2020-02-10 20:41:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,120 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:41:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777672004] [2020-02-10 20:41:27,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:27,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370982635] [2020-02-10 20:41:27,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:27,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:27,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:27,129 INFO L87 Difference]: Start difference. First operand 1565 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:41:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,330 INFO L93 Difference]: Finished difference Result 2981 states and 11870 transitions. [2020-02-10 20:41:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:27,330 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,337 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:41:27,338 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:41:27,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:41:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 20:41:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7095 transitions. [2020-02-10 20:41:27,404 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7095 transitions. Word has length 28 [2020-02-10 20:41:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,404 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7095 transitions. [2020-02-10 20:41:27,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7095 transitions. [2020-02-10 20:41:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:27,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,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] [2020-02-10 20:41:27,408 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash 760249910, now seen corresponding path program 50 times [2020-02-10 20:41:27,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791200606] [2020-02-10 20:41:27,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791200606] [2020-02-10 20:41:27,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:27,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067870045] [2020-02-10 20:41:27,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:27,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:27,947 INFO L87 Difference]: Start difference. First operand 1580 states and 7095 transitions. Second operand 11 states. [2020-02-10 20:41:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:28,125 INFO L93 Difference]: Finished difference Result 2982 states and 11867 transitions. [2020-02-10 20:41:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:28,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:28,132 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:41:28,133 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:41:28,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:41:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:41:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:41:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7081 transitions. [2020-02-10 20:41:28,200 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7081 transitions. Word has length 28 [2020-02-10 20:41:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:28,200 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7081 transitions. [2020-02-10 20:41:28,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7081 transitions. [2020-02-10 20:41:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:28,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:28,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] [2020-02-10 20:41:28,203 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1057537968, now seen corresponding path program 51 times [2020-02-10 20:41:28,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:28,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313818923] [2020-02-10 20:41:28,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:28,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313818923] [2020-02-10 20:41:28,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:28,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109162640] [2020-02-10 20:41:28,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:28,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:28,805 INFO L87 Difference]: Start difference. First operand 1575 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:41:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:28,981 INFO L93 Difference]: Finished difference Result 2983 states and 11869 transitions. [2020-02-10 20:41:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:28,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:28,990 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:41:28,990 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:41:28,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:41:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1580. [2020-02-10 20:41:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 20:41:29,057 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 20:41:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,057 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 20:41:29,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 20:41:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:29,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:29,060 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1176569526, now seen corresponding path program 52 times [2020-02-10 20:41:29,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174782630] [2020-02-10 20:41:29,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:29,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174782630] [2020-02-10 20:41:29,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:29,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:29,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656450194] [2020-02-10 20:41:29,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:29,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:29,621 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:41:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,799 INFO L93 Difference]: Finished difference Result 2986 states and 11870 transitions. [2020-02-10 20:41:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:29,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,807 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:41:29,808 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:41:29,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:41:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1575. [2020-02-10 20:41:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:41:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7076 transitions. [2020-02-10 20:41:29,874 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7076 transitions. Word has length 28 [2020-02-10 20:41:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,874 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7076 transitions. [2020-02-10 20:41:29,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7076 transitions. [2020-02-10 20:41:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:29,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,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] [2020-02-10 20:41:29,877 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1298105488, now seen corresponding path program 53 times [2020-02-10 20:41:29,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287103040] [2020-02-10 20:41:29,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287103040] [2020-02-10 20:41:30,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938642099] [2020-02-10 20:41:30,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:30,463 INFO L87 Difference]: Start difference. First operand 1575 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:41:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,642 INFO L93 Difference]: Finished difference Result 2986 states and 11871 transitions. [2020-02-10 20:41:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:30,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,649 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:41:30,650 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:41:30,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:41:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1581. [2020-02-10 20:41:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:41:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7087 transitions. [2020-02-10 20:41:30,717 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7087 transitions. Word has length 28 [2020-02-10 20:41:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,717 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7087 transitions. [2020-02-10 20:41:30,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7087 transitions. [2020-02-10 20:41:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:30,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:30,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] [2020-02-10 20:41:30,720 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1507456812, now seen corresponding path program 54 times [2020-02-10 20:41:30,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794913206] [2020-02-10 20:41:30,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,279 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:41:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:31,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794913206] [2020-02-10 20:41:31,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:31,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769175088] [2020-02-10 20:41:31,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:31,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:31,288 INFO L87 Difference]: Start difference. First operand 1581 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:41:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:31,461 INFO L93 Difference]: Finished difference Result 2988 states and 11869 transitions. [2020-02-10 20:41:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:31,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:31,469 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:41:31,469 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:41:31,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:41:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1570. [2020-02-10 20:41:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:41:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7062 transitions. [2020-02-10 20:41:31,536 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7062 transitions. Word has length 28 [2020-02-10 20:41:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:31,536 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7062 transitions. [2020-02-10 20:41:31,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7062 transitions. [2020-02-10 20:41:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:31,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:31,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] [2020-02-10 20:41:31,538 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash 603292734, now seen corresponding path program 55 times [2020-02-10 20:41:31,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:31,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368859226] [2020-02-10 20:41:31,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368859226] [2020-02-10 20:41:32,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:32,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313828374] [2020-02-10 20:41:32,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:32,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:32,088 INFO L87 Difference]: Start difference. First operand 1570 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:41:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:32,262 INFO L93 Difference]: Finished difference Result 2980 states and 11863 transitions. [2020-02-10 20:41:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:32,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:32,270 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:41:32,271 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:41:32,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:41:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1580. [2020-02-10 20:41:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 20:41:32,342 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 20:41:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:32,342 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 20:41:32,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 20:41:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:32,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:32,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] [2020-02-10 20:41:32,345 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1347995232, now seen corresponding path program 56 times [2020-02-10 20:41:32,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:32,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140733127] [2020-02-10 20:41:32,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,834 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-02-10 20:41:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140733127] [2020-02-10 20:41:32,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:32,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579385659] [2020-02-10 20:41:32,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:32,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:32,956 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:41:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,158 INFO L93 Difference]: Finished difference Result 2981 states and 11860 transitions. [2020-02-10 20:41:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:33,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,165 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:41:33,165 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:41:33,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:41:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1575. [2020-02-10 20:41:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:41:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7076 transitions. [2020-02-10 20:41:33,233 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7076 transitions. Word has length 28 [2020-02-10 20:41:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,234 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7076 transitions. [2020-02-10 20:41:33,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7076 transitions. [2020-02-10 20:41:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:33,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,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] [2020-02-10 20:41:33,237 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1005022448, now seen corresponding path program 57 times [2020-02-10 20:41:33,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262751214] [2020-02-10 20:41:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:33,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262751214] [2020-02-10 20:41:33,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:33,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:33,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278839276] [2020-02-10 20:41:33,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:33,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:33,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:33,790 INFO L87 Difference]: Start difference. First operand 1575 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:41:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,093 INFO L93 Difference]: Finished difference Result 2981 states and 11860 transitions. [2020-02-10 20:41:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:34,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,104 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:41:34,104 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:41:34,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:41:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 20:41:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7085 transitions. [2020-02-10 20:41:34,206 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7085 transitions. Word has length 28 [2020-02-10 20:41:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,206 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7085 transitions. [2020-02-10 20:41:34,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7085 transitions. [2020-02-10 20:41:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:34,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:34,210 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash 657630240, now seen corresponding path program 58 times [2020-02-10 20:41:34,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602434687] [2020-02-10 20:41:34,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602434687] [2020-02-10 20:41:34,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:34,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365129473] [2020-02-10 20:41:34,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:34,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:34,766 INFO L87 Difference]: Start difference. First operand 1580 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:41:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,947 INFO L93 Difference]: Finished difference Result 2983 states and 11859 transitions. [2020-02-10 20:41:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:34,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,955 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:41:34,955 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:41:34,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:41:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:41:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:41:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:41:35,023 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:41:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:35,023 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:41:35,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:41:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:35,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:35,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] [2020-02-10 20:41:35,026 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1350621008, now seen corresponding path program 59 times [2020-02-10 20:41:35,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:35,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213898566] [2020-02-10 20:41:35,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213898566] [2020-02-10 20:41:35,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:35,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348782390] [2020-02-10 20:41:35,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:35,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:35,580 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:41:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:35,762 INFO L93 Difference]: Finished difference Result 2984 states and 11862 transitions. [2020-02-10 20:41:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:35,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:35,771 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:41:35,771 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:41:35,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:41:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1581. [2020-02-10 20:41:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:41:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7082 transitions. [2020-02-10 20:41:35,838 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7082 transitions. Word has length 28 [2020-02-10 20:41:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:35,838 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7082 transitions. [2020-02-10 20:41:35,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7082 transitions. [2020-02-10 20:41:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:35,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:35,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:35,841 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2026396098, now seen corresponding path program 60 times [2020-02-10 20:41:35,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:35,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037888704] [2020-02-10 20:41:35,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:36,394 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:41:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:36,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037888704] [2020-02-10 20:41:36,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:36,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:36,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637330105] [2020-02-10 20:41:36,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:36,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:36,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:36,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:36,403 INFO L87 Difference]: Start difference. First operand 1581 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:41:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,594 INFO L93 Difference]: Finished difference Result 2985 states and 11858 transitions. [2020-02-10 20:41:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:36,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,602 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:41:36,602 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:41:36,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:41:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1570. [2020-02-10 20:41:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:41:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7057 transitions. [2020-02-10 20:41:36,670 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7057 transitions. Word has length 28 [2020-02-10 20:41:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,670 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7057 transitions. [2020-02-10 20:41:36,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7057 transitions. [2020-02-10 20:41:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:36,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,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] [2020-02-10 20:41:36,673 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 624298942, now seen corresponding path program 61 times [2020-02-10 20:41:36,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036461788] [2020-02-10 20:41:36,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036461788] [2020-02-10 20:41:37,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:37,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105739496] [2020-02-10 20:41:37,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:37,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:37,233 INFO L87 Difference]: Start difference. First operand 1570 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:41:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,428 INFO L93 Difference]: Finished difference Result 2985 states and 11869 transitions. [2020-02-10 20:41:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:37,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,436 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:41:37,436 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:41:37,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:41:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1580. [2020-02-10 20:41:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7085 transitions. [2020-02-10 20:41:37,547 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7085 transitions. Word has length 28 [2020-02-10 20:41:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,548 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7085 transitions. [2020-02-10 20:41:37,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7085 transitions. [2020-02-10 20:41:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:37,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:37,550 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1436560860, now seen corresponding path program 62 times [2020-02-10 20:41:37,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117938252] [2020-02-10 20:41:37,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117938252] [2020-02-10 20:41:38,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:38,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085524104] [2020-02-10 20:41:38,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:38,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:38,086 INFO L87 Difference]: Start difference. First operand 1580 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:41:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:38,272 INFO L93 Difference]: Finished difference Result 2988 states and 11870 transitions. [2020-02-10 20:41:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:38,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:38,280 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:41:38,280 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:41:38,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:41:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1575. [2020-02-10 20:41:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:41:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:41:38,349 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:41:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:38,350 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:41:38,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:41:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:38,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:38,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] [2020-02-10 20:41:38,352 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 89069140, now seen corresponding path program 63 times [2020-02-10 20:41:38,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:38,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793769909] [2020-02-10 20:41:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793769909] [2020-02-10 20:41:38,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:38,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429799188] [2020-02-10 20:41:38,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:38,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:38,889 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:41:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,063 INFO L93 Difference]: Finished difference Result 2984 states and 11862 transitions. [2020-02-10 20:41:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:39,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,070 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:41:39,070 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:41:39,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:41:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1580. [2020-02-10 20:41:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7080 transitions. [2020-02-10 20:41:39,137 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7080 transitions. Word has length 28 [2020-02-10 20:41:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,137 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7080 transitions. [2020-02-10 20:41:39,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7080 transitions. [2020-02-10 20:41:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:39,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,140 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1751721828, now seen corresponding path program 64 times [2020-02-10 20:41:39,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036956339] [2020-02-10 20:41:39,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:39,668 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:41:39,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 20:41:39,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036956339] [2020-02-10 20:41:39,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:39,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:39,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157917241] [2020-02-10 20:41:39,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:39,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:39,677 INFO L87 Difference]: Start difference. First operand 1580 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:41:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,857 INFO L93 Difference]: Finished difference Result 2986 states and 11861 transitions. [2020-02-10 20:41:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:39,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,865 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:41:39,865 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:41:39,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:41:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1575. [2020-02-10 20:41:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:41:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 20:41:39,933 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 20:41:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,934 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 20:41:39,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 20:41:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:39,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,936 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1433935084, now seen corresponding path program 65 times [2020-02-10 20:41:39,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781445197] [2020-02-10 20:41:39,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:40,466 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:41:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:40,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781445197] [2020-02-10 20:41:40,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:40,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:40,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863013324] [2020-02-10 20:41:40,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:40,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:40,475 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:41:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,654 INFO L93 Difference]: Finished difference Result 2992 states and 11875 transitions. [2020-02-10 20:41:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:40,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,663 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:41:40,663 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:41:40,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:41:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1582. [2020-02-10 20:41:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:41:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7079 transitions. [2020-02-10 20:41:40,730 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7079 transitions. Word has length 28 [2020-02-10 20:41:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,731 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7079 transitions. [2020-02-10 20:41:40,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7079 transitions. [2020-02-10 20:41:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:40,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,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] [2020-02-10 20:41:40,734 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2005389890, now seen corresponding path program 66 times [2020-02-10 20:41:40,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135853616] [2020-02-10 20:41:40,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:41,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135853616] [2020-02-10 20:41:41,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:41,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360398186] [2020-02-10 20:41:41,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:41,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:41,300 INFO L87 Difference]: Start difference. First operand 1582 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:41:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:41,485 INFO L93 Difference]: Finished difference Result 2991 states and 11866 transitions. [2020-02-10 20:41:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:41,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:41,494 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:41:41,494 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:41:41,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:41:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1570. [2020-02-10 20:41:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:41:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:41:41,562 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:41:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:41,562 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:41:41,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:41:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:41,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:41,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] [2020-02-10 20:41:41,565 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1379504544, now seen corresponding path program 67 times [2020-02-10 20:41:41,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:41,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606377611] [2020-02-10 20:41:41,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:42,179 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:41:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:42,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606377611] [2020-02-10 20:41:42,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:42,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:42,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227008502] [2020-02-10 20:41:42,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:42,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:42,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:42,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:42,187 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:41:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:42,371 INFO L93 Difference]: Finished difference Result 2992 states and 11883 transitions. [2020-02-10 20:41:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:42,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:42,378 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:41:42,379 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:41:42,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:41:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1582. [2020-02-10 20:41:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:41:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7086 transitions. [2020-02-10 20:41:42,446 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7086 transitions. Word has length 28 [2020-02-10 20:41:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:42,446 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7086 transitions. [2020-02-10 20:41:42,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7086 transitions. [2020-02-10 20:41:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:42,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:42,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:42,449 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1426057756, now seen corresponding path program 68 times [2020-02-10 20:41:42,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:42,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087538861] [2020-02-10 20:41:42,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:42,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087538861] [2020-02-10 20:41:42,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:42,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:42,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615546743] [2020-02-10 20:41:42,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:42,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:42,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:42,988 INFO L87 Difference]: Start difference. First operand 1582 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:41:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,200 INFO L93 Difference]: Finished difference Result 2994 states and 11881 transitions. [2020-02-10 20:41:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:43,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,207 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:41:43,207 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:41:43,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:41:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1576. [2020-02-10 20:41:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:41:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7069 transitions. [2020-02-10 20:41:43,274 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7069 transitions. Word has length 28 [2020-02-10 20:41:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,274 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7069 transitions. [2020-02-10 20:41:43,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7069 transitions. [2020-02-10 20:41:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:43,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:43,277 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 844274742, now seen corresponding path program 69 times [2020-02-10 20:41:43,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353854425] [2020-02-10 20:41:43,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:43,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353854425] [2020-02-10 20:41:43,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:43,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773456136] [2020-02-10 20:41:43,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:43,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:43,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:43,829 INFO L87 Difference]: Start difference. First operand 1576 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:41:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:44,001 INFO L93 Difference]: Finished difference Result 2991 states and 11875 transitions. [2020-02-10 20:41:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:44,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:44,008 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:41:44,008 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:41:44,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:41:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1582. [2020-02-10 20:41:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:41:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 20:41:44,078 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 20:41:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:44,078 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 20:41:44,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 20:41:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:44,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:44,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] [2020-02-10 20:41:44,081 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1762224932, now seen corresponding path program 70 times [2020-02-10 20:41:44,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:44,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070926876] [2020-02-10 20:41:44,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:44,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070926876] [2020-02-10 20:41:44,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:44,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:44,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072974950] [2020-02-10 20:41:44,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:44,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:44,638 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:41:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:44,817 INFO L93 Difference]: Finished difference Result 2992 states and 11871 transitions. [2020-02-10 20:41:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:44,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:44,826 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:41:44,826 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:41:44,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:41:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1576. [2020-02-10 20:41:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:41:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:41:44,894 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:41:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:44,895 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:41:44,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:41:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:44,897 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:44,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:44,897 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1260594358, now seen corresponding path program 71 times [2020-02-10 20:41:44,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:44,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953414068] [2020-02-10 20:41:44,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:45,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953414068] [2020-02-10 20:41:45,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:45,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:45,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361665334] [2020-02-10 20:41:45,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:45,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:45,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:45,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:45,438 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:41:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:45,651 INFO L93 Difference]: Finished difference Result 2996 states and 11880 transitions. [2020-02-10 20:41:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:45,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:45,659 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:41:45,659 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:41:45,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:41:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1583. [2020-02-10 20:41:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:41:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7076 transitions. [2020-02-10 20:41:45,726 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7076 transitions. Word has length 28 [2020-02-10 20:41:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:45,726 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7076 transitions. [2020-02-10 20:41:45,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7076 transitions. [2020-02-10 20:41:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:45,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:45,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:45,728 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:45,729 INFO L82 PathProgramCache]: Analyzing trace with hash 689139552, now seen corresponding path program 72 times [2020-02-10 20:41:45,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:45,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774375947] [2020-02-10 20:41:45,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:46,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774375947] [2020-02-10 20:41:46,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:46,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040617846] [2020-02-10 20:41:46,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:46,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:46,279 INFO L87 Difference]: Start difference. First operand 1583 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:41:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,487 INFO L93 Difference]: Finished difference Result 2995 states and 11871 transitions. [2020-02-10 20:41:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:46,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,495 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:41:46,495 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:41:46,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:41:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1565. [2020-02-10 20:41:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:41:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7038 transitions. [2020-02-10 20:41:46,613 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7038 transitions. Word has length 28 [2020-02-10 20:41:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,614 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7038 transitions. [2020-02-10 20:41:46,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7038 transitions. [2020-02-10 20:41:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:46,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41: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] [2020-02-10 20:41:46,616 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1952084594, now seen corresponding path program 73 times [2020-02-10 20:41:46,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201006402] [2020-02-10 20:41:46,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201006402] [2020-02-10 20:41:47,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:47,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888058604] [2020-02-10 20:41:47,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:47,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:47,158 INFO L87 Difference]: Start difference. First operand 1565 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:41:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:47,331 INFO L93 Difference]: Finished difference Result 3018 states and 11947 transitions. [2020-02-10 20:41:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:47,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:47,339 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 20:41:47,339 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 20:41:47,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 20:41:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1586. [2020-02-10 20:41:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:41:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7106 transitions. [2020-02-10 20:41:47,408 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7106 transitions. Word has length 28 [2020-02-10 20:41:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:47,408 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7106 transitions. [2020-02-10 20:41:47,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7106 transitions. [2020-02-10 20:41:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:47,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:47,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] [2020-02-10 20:41:47,411 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:47,411 INFO L82 PathProgramCache]: Analyzing trace with hash -853477706, now seen corresponding path program 74 times [2020-02-10 20:41:47,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342800472] [2020-02-10 20:41:47,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342800472] [2020-02-10 20:41:47,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:47,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876762211] [2020-02-10 20:41:47,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:47,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:47,966 INFO L87 Difference]: Start difference. First operand 1586 states and 7106 transitions. Second operand 11 states. [2020-02-10 20:41:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:48,109 INFO L93 Difference]: Finished difference Result 3023 states and 11951 transitions. [2020-02-10 20:41:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:48,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:48,120 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:41:48,120 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 20:41:48,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 20:41:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1580. [2020-02-10 20:41:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7089 transitions. [2020-02-10 20:41:48,188 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7089 transitions. Word has length 28 [2020-02-10 20:41:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:48,188 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7089 transitions. [2020-02-10 20:41:48,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7089 transitions. [2020-02-10 20:41:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:48,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:48,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:48,191 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash -731941744, now seen corresponding path program 75 times [2020-02-10 20:41:48,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:48,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677746467] [2020-02-10 20:41:48,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:48,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677746467] [2020-02-10 20:41:48,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:48,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:48,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469753095] [2020-02-10 20:41:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:48,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:48,755 INFO L87 Difference]: Start difference. First operand 1580 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:41:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:48,936 INFO L93 Difference]: Finished difference Result 3015 states and 11936 transitions. [2020-02-10 20:41:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:48,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:48,943 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 20:41:48,943 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:41:48,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:41:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1585. [2020-02-10 20:41:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:41:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7098 transitions. [2020-02-10 20:41:49,010 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7098 transitions. Word has length 28 [2020-02-10 20:41:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,011 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7098 transitions. [2020-02-10 20:41:49,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7098 transitions. [2020-02-10 20:41:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:49,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,013 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1502165750, now seen corresponding path program 76 times [2020-02-10 20:41:49,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250966922] [2020-02-10 20:41:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:49,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250966922] [2020-02-10 20:41:49,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:49,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:49,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23552806] [2020-02-10 20:41:49,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:49,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:49,568 INFO L87 Difference]: Start difference. First operand 1585 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:41:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,794 INFO L93 Difference]: Finished difference Result 3018 states and 11937 transitions. [2020-02-10 20:41:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:49,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,801 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 20:41:49,802 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:41:49,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:41:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1580. [2020-02-10 20:41:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:41:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7084 transitions. [2020-02-10 20:41:49,869 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7084 transitions. Word has length 28 [2020-02-10 20:41:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,870 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7084 transitions. [2020-02-10 20:41:49,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7084 transitions. [2020-02-10 20:41:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:49,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,872 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -315622128, now seen corresponding path program 77 times [2020-02-10 20:41:49,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060177913] [2020-02-10 20:41:49,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:50,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060177913] [2020-02-10 20:41:50,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:50,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:50,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251277468] [2020-02-10 20:41:50,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:50,424 INFO L87 Difference]: Start difference. First operand 1580 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:41:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:50,588 INFO L93 Difference]: Finished difference Result 3030 states and 11961 transitions. [2020-02-10 20:41:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:50,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:50,596 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 20:41:50,596 INFO L226 Difference]: Without dead ends: 3010 [2020-02-10 20:41:50,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-02-10 20:41:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1590. [2020-02-10 20:41:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:41:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7101 transitions. [2020-02-10 20:41:50,666 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7101 transitions. Word has length 28 [2020-02-10 20:41:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:50,667 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7101 transitions. [2020-02-10 20:41:50,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7101 transitions. [2020-02-10 20:41:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:50,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:50,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:50,670 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash 429080370, now seen corresponding path program 78 times [2020-02-10 20:41:50,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:50,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82665556] [2020-02-10 20:41:50,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:51,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82665556] [2020-02-10 20:41:51,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:51,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:51,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428697233] [2020-02-10 20:41:51,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:51,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:51,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:51,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:51,225 INFO L87 Difference]: Start difference. First operand 1590 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:41:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:51,465 INFO L93 Difference]: Finished difference Result 3028 states and 11949 transitions. [2020-02-10 20:41:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:51,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:51,473 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 20:41:51,473 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:41:51,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:41:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1573. [2020-02-10 20:41:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:41:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7064 transitions. [2020-02-10 20:41:51,542 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7064 transitions. Word has length 28 [2020-02-10 20:41:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:51,542 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7064 transitions. [2020-02-10 20:41:51,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7064 transitions. [2020-02-10 20:41:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:51,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:51,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] [2020-02-10 20:41:51,545 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:51,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1755137380, now seen corresponding path program 79 times [2020-02-10 20:41:51,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:51,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362644408] [2020-02-10 20:41:51,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362644408] [2020-02-10 20:41:52,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:52,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109142122] [2020-02-10 20:41:52,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:52,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:52,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:52,072 INFO L87 Difference]: Start difference. First operand 1573 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:41:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,271 INFO L93 Difference]: Finished difference Result 3014 states and 11932 transitions. [2020-02-10 20:41:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:52,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,280 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 20:41:52,280 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 20:41:52,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 20:41:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1585. [2020-02-10 20:41:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:41:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7097 transitions. [2020-02-10 20:41:52,349 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7097 transitions. Word has length 28 [2020-02-10 20:41:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,349 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7097 transitions. [2020-02-10 20:41:52,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7097 transitions. [2020-02-10 20:41:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:52,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,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] [2020-02-10 20:41:52,352 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash -265732384, now seen corresponding path program 80 times [2020-02-10 20:41:52,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127527698] [2020-02-10 20:41:52,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127527698] [2020-02-10 20:41:52,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:52,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103360569] [2020-02-10 20:41:52,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:52,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:52,893 INFO L87 Difference]: Start difference. First operand 1585 states and 7097 transitions. Second operand 11 states. [2020-02-10 20:41:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,079 INFO L93 Difference]: Finished difference Result 3019 states and 11936 transitions. [2020-02-10 20:41:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:53,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,086 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 20:41:53,086 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:41:53,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:41:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1579. [2020-02-10 20:41:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:41:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7080 transitions. [2020-02-10 20:41:53,153 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7080 transitions. Word has length 28 [2020-02-10 20:41:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,154 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7080 transitions. [2020-02-10 20:41:53,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7080 transitions. [2020-02-10 20:41:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:53,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:53,156 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash -679426224, now seen corresponding path program 81 times [2020-02-10 20:41:53,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772925649] [2020-02-10 20:41:53,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772925649] [2020-02-10 20:41:53,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:53,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054621877] [2020-02-10 20:41:53,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:53,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:53,689 INFO L87 Difference]: Start difference. First operand 1579 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:41:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,879 INFO L93 Difference]: Finished difference Result 3010 states and 11919 transitions. [2020-02-10 20:41:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:53,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,887 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:41:53,887 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:41:53,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:41:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1584. [2020-02-10 20:41:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:41:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7089 transitions. [2020-02-10 20:41:53,954 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7089 transitions. Word has length 28 [2020-02-10 20:41:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,955 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7089 transitions. [2020-02-10 20:41:53,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7089 transitions. [2020-02-10 20:41:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:53,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:53,957 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash 983226464, now seen corresponding path program 82 times [2020-02-10 20:41:53,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246676426] [2020-02-10 20:41:53,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:54,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246676426] [2020-02-10 20:41:54,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:54,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:54,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166689843] [2020-02-10 20:41:54,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:54,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:54,562 INFO L87 Difference]: Start difference. First operand 1584 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:41:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:54,756 INFO L93 Difference]: Finished difference Result 3012 states and 11918 transitions. [2020-02-10 20:41:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:54,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:54,765 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:41:54,765 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:41:54,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:41:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1579. [2020-02-10 20:41:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:41:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7075 transitions. [2020-02-10 20:41:54,832 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7075 transitions. Word has length 28 [2020-02-10 20:41:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:54,832 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7075 transitions. [2020-02-10 20:41:54,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7075 transitions. [2020-02-10 20:41:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:54,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:54,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:54,835 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash -263106608, now seen corresponding path program 83 times [2020-02-10 20:41:54,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:54,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650420145] [2020-02-10 20:41:54,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650420145] [2020-02-10 20:41:55,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:55,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917461896] [2020-02-10 20:41:55,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:55,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:55,374 INFO L87 Difference]: Start difference. First operand 1579 states and 7075 transitions. Second operand 11 states. [2020-02-10 20:41:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,566 INFO L93 Difference]: Finished difference Result 3023 states and 11940 transitions. [2020-02-10 20:41:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:55,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,574 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:41:55,574 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 20:41:55,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 20:41:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1587. [2020-02-10 20:41:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:41:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7089 transitions. [2020-02-10 20:41:55,643 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7089 transitions. Word has length 28 [2020-02-10 20:41:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:55,643 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7089 transitions. [2020-02-10 20:41:55,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7089 transitions. [2020-02-10 20:41:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:55,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:55,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:55,646 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -89858916, now seen corresponding path program 84 times [2020-02-10 20:41:55,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:55,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593609992] [2020-02-10 20:41:55,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:56,079 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-02-10 20:41:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:56,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593609992] [2020-02-10 20:41:56,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:56,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:56,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954249141] [2020-02-10 20:41:56,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:56,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:56,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:56,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:56,205 INFO L87 Difference]: Start difference. First operand 1587 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:41:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:56,401 INFO L93 Difference]: Finished difference Result 3020 states and 11927 transitions. [2020-02-10 20:41:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:56,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:56,409 INFO L225 Difference]: With dead ends: 3020 [2020-02-10 20:41:56,409 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:41:56,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:41:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1573. [2020-02-10 20:41:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:41:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7058 transitions. [2020-02-10 20:41:56,478 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7058 transitions. Word has length 28 [2020-02-10 20:41:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,478 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7058 transitions. [2020-02-10 20:41:56,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7058 transitions. [2020-02-10 20:41:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:56,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:56,480 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1744634276, now seen corresponding path program 85 times [2020-02-10 20:41:56,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216055499] [2020-02-10 20:41:56,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216055499] [2020-02-10 20:41:57,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:57,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038682027] [2020-02-10 20:41:57,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:57,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:57,017 INFO L87 Difference]: Start difference. First operand 1573 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:41:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:57,202 INFO L93 Difference]: Finished difference Result 3006 states and 11911 transitions. [2020-02-10 20:41:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:57,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:57,210 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:41:57,210 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:41:57,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:41:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1583. [2020-02-10 20:41:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:41:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7086 transitions. [2020-02-10 20:41:57,277 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7086 transitions. Word has length 28 [2020-02-10 20:41:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:57,277 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7086 transitions. [2020-02-10 20:41:57,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7086 transitions. [2020-02-10 20:41:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:57,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:57,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:57,280 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 489473218, now seen corresponding path program 86 times [2020-02-10 20:41:57,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:57,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782359605] [2020-02-10 20:41:57,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782359605] [2020-02-10 20:41:57,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:57,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106434303] [2020-02-10 20:41:57,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:57,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:57,817 INFO L87 Difference]: Start difference. First operand 1583 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:41:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,073 INFO L93 Difference]: Finished difference Result 3009 states and 11912 transitions. [2020-02-10 20:41:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:58,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,081 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:41:58,082 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:41:58,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:41:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1578. [2020-02-10 20:41:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:41:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 20:41:58,149 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 20:41:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,149 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 20:41:58,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 20:41:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:58,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,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] [2020-02-10 20:41:58,151 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2015103218, now seen corresponding path program 87 times [2020-02-10 20:41:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633004370] [2020-02-10 20:41:58,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:58,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633004370] [2020-02-10 20:41:58,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:58,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:58,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823343681] [2020-02-10 20:41:58,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:58,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:58,685 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:41:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,913 INFO L93 Difference]: Finished difference Result 3005 states and 11904 transitions. [2020-02-10 20:41:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:58,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,921 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:41:58,921 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:41:58,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:58,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:41:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1583. [2020-02-10 20:41:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:41:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7081 transitions. [2020-02-10 20:41:58,990 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7081 transitions. Word has length 28 [2020-02-10 20:41:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,990 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7081 transitions. [2020-02-10 20:41:58,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7081 transitions. [2020-02-10 20:41:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:58,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:58,993 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash -617211390, now seen corresponding path program 88 times [2020-02-10 20:41:58,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078651421] [2020-02-10 20:41:58,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:59,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078651421] [2020-02-10 20:41:59,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:41:59,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244269106] [2020-02-10 20:41:59,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:41:59,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:41:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:59,539 INFO L87 Difference]: Start difference. First operand 1583 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:41:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,732 INFO L93 Difference]: Finished difference Result 3007 states and 11903 transitions. [2020-02-10 20:41:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:41:59,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:41:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,740 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:41:59,740 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:41:59,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:41:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:41:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1578. [2020-02-10 20:41:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:41:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 20:41:59,807 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 20:41:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,807 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 20:41:59,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:41:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 20:41:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:41:59,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,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] [2020-02-10 20:41:59,810 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:41:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash 492098994, now seen corresponding path program 89 times [2020-02-10 20:41:59,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028507835] [2020-02-10 20:41:59,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028507835] [2020-02-10 20:42:00,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58865068] [2020-02-10 20:42:00,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:00,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:00,352 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:42:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:00,541 INFO L93 Difference]: Finished difference Result 3013 states and 11917 transitions. [2020-02-10 20:42:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:00,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:00,548 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:42:00,548 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:42:00,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:42:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1585. [2020-02-10 20:42:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:42:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7080 transitions. [2020-02-10 20:42:00,616 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7080 transitions. Word has length 28 [2020-02-10 20:42:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:00,617 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7080 transitions. [2020-02-10 20:42:00,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7080 transitions. [2020-02-10 20:42:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:00,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:00,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:00,619 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash -79355812, now seen corresponding path program 90 times [2020-02-10 20:42:00,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:00,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360242031] [2020-02-10 20:42:00,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:01,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360242031] [2020-02-10 20:42:01,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:01,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:01,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782557559] [2020-02-10 20:42:01,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:01,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:01,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:01,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:01,186 INFO L87 Difference]: Start difference. First operand 1585 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:42:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,405 INFO L93 Difference]: Finished difference Result 3012 states and 11908 transitions. [2020-02-10 20:42:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:01,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,413 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:42:01,413 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:42:01,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:42:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1573. [2020-02-10 20:42:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:42:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 20:42:01,484 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 20:42:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,484 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 20:42:01,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 20:42:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:01,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,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] [2020-02-10 20:42:01,488 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash -234223072, now seen corresponding path program 91 times [2020-02-10 20:42:01,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123514773] [2020-02-10 20:42:01,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123514773] [2020-02-10 20:42:02,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:02,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020017921] [2020-02-10 20:42:02,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:02,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:02,089 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:42:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:02,223 INFO L93 Difference]: Finished difference Result 3039 states and 11979 transitions. [2020-02-10 20:42:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:02,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:02,231 INFO L225 Difference]: With dead ends: 3039 [2020-02-10 20:42:02,231 INFO L226 Difference]: Without dead ends: 3019 [2020-02-10 20:42:02,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2020-02-10 20:42:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 1593. [2020-02-10 20:42:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:42:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7103 transitions. [2020-02-10 20:42:02,300 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7103 transitions. Word has length 28 [2020-02-10 20:42:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:02,300 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7103 transitions. [2020-02-10 20:42:02,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7103 transitions. [2020-02-10 20:42:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:02,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:02,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] [2020-02-10 20:42:02,303 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 510479426, now seen corresponding path program 92 times [2020-02-10 20:42:02,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:02,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562651641] [2020-02-10 20:42:02,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,883 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562651641] [2020-02-10 20:42:02,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:02,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733197005] [2020-02-10 20:42:02,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:02,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:02,890 INFO L87 Difference]: Start difference. First operand 1593 states and 7103 transitions. Second operand 11 states. [2020-02-10 20:42:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,065 INFO L93 Difference]: Finished difference Result 3037 states and 11967 transitions. [2020-02-10 20:42:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:03,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,073 INFO L225 Difference]: With dead ends: 3037 [2020-02-10 20:42:03,074 INFO L226 Difference]: Without dead ends: 3009 [2020-02-10 20:42:03,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2020-02-10 20:42:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1583. [2020-02-10 20:42:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:42:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7077 transitions. [2020-02-10 20:42:03,143 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7077 transitions. Word has length 28 [2020-02-10 20:42:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,143 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7077 transitions. [2020-02-10 20:42:03,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7077 transitions. [2020-02-10 20:42:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:03,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,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] [2020-02-10 20:42:03,146 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,146 INFO L82 PathProgramCache]: Analyzing trace with hash -769452874, now seen corresponding path program 93 times [2020-02-10 20:42:03,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144162269] [2020-02-10 20:42:03,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:03,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144162269] [2020-02-10 20:42:03,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:03,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:03,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329170394] [2020-02-10 20:42:03,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:03,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:03,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:03,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:03,708 INFO L87 Difference]: Start difference. First operand 1583 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:42:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,872 INFO L93 Difference]: Finished difference Result 3036 states and 11964 transitions. [2020-02-10 20:42:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:03,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,880 INFO L225 Difference]: With dead ends: 3036 [2020-02-10 20:42:03,880 INFO L226 Difference]: Without dead ends: 3016 [2020-02-10 20:42:03,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-02-10 20:42:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1591. [2020-02-10 20:42:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:42:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7091 transitions. [2020-02-10 20:42:03,956 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7091 transitions. Word has length 28 [2020-02-10 20:42:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,956 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7091 transitions. [2020-02-10 20:42:03,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7091 transitions. [2020-02-10 20:42:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:03,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:03,959 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash -596205182, now seen corresponding path program 94 times [2020-02-10 20:42:03,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792286418] [2020-02-10 20:42:03,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:04,563 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-02-10 20:42:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792286418] [2020-02-10 20:42:04,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:04,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:04,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641483160] [2020-02-10 20:42:04,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:04,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:04,680 INFO L87 Difference]: Start difference. First operand 1591 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:42:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,848 INFO L93 Difference]: Finished difference Result 3033 states and 11951 transitions. [2020-02-10 20:42:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:04,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,856 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 20:42:04,856 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:42:04,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:42:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1583. [2020-02-10 20:42:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:42:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7069 transitions. [2020-02-10 20:42:04,925 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7069 transitions. Word has length 28 [2020-02-10 20:42:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,925 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7069 transitions. [2020-02-10 20:42:04,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7069 transitions. [2020-02-10 20:42:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:04,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,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] [2020-02-10 20:42:04,927 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1586190582, now seen corresponding path program 95 times [2020-02-10 20:42:04,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570794486] [2020-02-10 20:42:04,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570794486] [2020-02-10 20:42:05,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:05,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773632510] [2020-02-10 20:42:05,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:05,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:05,492 INFO L87 Difference]: Start difference. First operand 1583 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:42:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:05,680 INFO L93 Difference]: Finished difference Result 3031 states and 11948 transitions. [2020-02-10 20:42:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:05,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:05,688 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 20:42:05,689 INFO L226 Difference]: Without dead ends: 3013 [2020-02-10 20:42:05,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2020-02-10 20:42:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 1590. [2020-02-10 20:42:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:42:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7082 transitions. [2020-02-10 20:42:05,787 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7082 transitions. Word has length 28 [2020-02-10 20:42:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:05,787 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7082 transitions. [2020-02-10 20:42:05,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7082 transitions. [2020-02-10 20:42:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:05,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:05,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] [2020-02-10 20:42:05,790 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1014735776, now seen corresponding path program 96 times [2020-02-10 20:42:05,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:05,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35095844] [2020-02-10 20:42:05,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:06,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35095844] [2020-02-10 20:42:06,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:06,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:06,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963675802] [2020-02-10 20:42:06,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:06,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:06,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:06,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:06,356 INFO L87 Difference]: Start difference. First operand 1590 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:42:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:06,547 INFO L93 Difference]: Finished difference Result 3030 states and 11939 transitions. [2020-02-10 20:42:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:06,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:06,555 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 20:42:06,555 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:42:06,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:42:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1565. [2020-02-10 20:42:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:42:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7030 transitions. [2020-02-10 20:42:06,622 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7030 transitions. Word has length 28 [2020-02-10 20:42:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:06,623 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7030 transitions. [2020-02-10 20:42:06,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7030 transitions. [2020-02-10 20:42:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:06,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:06,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] [2020-02-10 20:42:06,625 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 338356978, now seen corresponding path program 97 times [2020-02-10 20:42:06,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:06,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141432829] [2020-02-10 20:42:06,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:07,172 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:42:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:07,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141432829] [2020-02-10 20:42:07,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:07,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:07,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079838724] [2020-02-10 20:42:07,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:07,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:07,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:07,180 INFO L87 Difference]: Start difference. First operand 1565 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:42:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,355 INFO L93 Difference]: Finished difference Result 3034 states and 11987 transitions. [2020-02-10 20:42:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:07,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,363 INFO L225 Difference]: With dead ends: 3034 [2020-02-10 20:42:07,363 INFO L226 Difference]: Without dead ends: 3018 [2020-02-10 20:42:07,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-02-10 20:42:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1590. [2020-02-10 20:42:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:42:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7110 transitions. [2020-02-10 20:42:07,432 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7110 transitions. Word has length 28 [2020-02-10 20:42:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,432 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7110 transitions. [2020-02-10 20:42:07,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7110 transitions. [2020-02-10 20:42:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:07,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:07,435 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1083059476, now seen corresponding path program 98 times [2020-02-10 20:42:07,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717241353] [2020-02-10 20:42:07,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717241353] [2020-02-10 20:42:08,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:08,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261967819] [2020-02-10 20:42:08,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:08,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:08,032 INFO L87 Difference]: Start difference. First operand 1590 states and 7110 transitions. Second operand 11 states. [2020-02-10 20:42:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:08,189 INFO L93 Difference]: Finished difference Result 3038 states and 11988 transitions. [2020-02-10 20:42:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:08,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:08,197 INFO L225 Difference]: With dead ends: 3038 [2020-02-10 20:42:08,197 INFO L226 Difference]: Without dead ends: 3011 [2020-02-10 20:42:08,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-02-10 20:42:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1583. [2020-02-10 20:42:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:42:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7090 transitions. [2020-02-10 20:42:08,265 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7090 transitions. Word has length 28 [2020-02-10 20:42:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:08,265 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7090 transitions. [2020-02-10 20:42:08,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7090 transitions. [2020-02-10 20:42:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:08,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:08,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:08,268 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1949297936, now seen corresponding path program 99 times [2020-02-10 20:42:08,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:08,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333807011] [2020-02-10 20:42:08,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,824 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333807011] [2020-02-10 20:42:08,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:08,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008301406] [2020-02-10 20:42:08,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:08,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:08,832 INFO L87 Difference]: Start difference. First operand 1583 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:42:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,071 INFO L93 Difference]: Finished difference Result 3031 states and 11975 transitions. [2020-02-10 20:42:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:09,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,079 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 20:42:09,079 INFO L226 Difference]: Without dead ends: 3015 [2020-02-10 20:42:09,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2020-02-10 20:42:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 1589. [2020-02-10 20:42:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:42:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7101 transitions. [2020-02-10 20:42:09,148 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7101 transitions. Word has length 28 [2020-02-10 20:42:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:09,148 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7101 transitions. [2020-02-10 20:42:09,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7101 transitions. [2020-02-10 20:42:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:09,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:09,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] [2020-02-10 20:42:09,151 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -856264364, now seen corresponding path program 100 times [2020-02-10 20:42:09,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:09,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004504538] [2020-02-10 20:42:09,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:09,717 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:09,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004504538] [2020-02-10 20:42:09,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:09,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:09,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120056337] [2020-02-10 20:42:09,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:09,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:09,726 INFO L87 Difference]: Start difference. First operand 1589 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:42:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,930 INFO L93 Difference]: Finished difference Result 3033 states and 11973 transitions. [2020-02-10 20:42:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:09,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,937 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 20:42:09,937 INFO L226 Difference]: Without dead ends: 3009 [2020-02-10 20:42:09,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2020-02-10 20:42:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1583. [2020-02-10 20:42:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:42:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7084 transitions. [2020-02-10 20:42:10,004 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7084 transitions. Word has length 28 [2020-02-10 20:42:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,005 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7084 transitions. [2020-02-10 20:42:10,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7084 transitions. [2020-02-10 20:42:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:10,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,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] [2020-02-10 20:42:10,007 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 9974096, now seen corresponding path program 101 times [2020-02-10 20:42:10,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786254049] [2020-02-10 20:42:10,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786254049] [2020-02-10 20:42:10,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:10,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520199425] [2020-02-10 20:42:10,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:10,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:10,588 INFO L87 Difference]: Start difference. First operand 1583 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:42:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,749 INFO L93 Difference]: Finished difference Result 3043 states and 11992 transitions. [2020-02-10 20:42:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:10,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,757 INFO L225 Difference]: With dead ends: 3043 [2020-02-10 20:42:10,757 INFO L226 Difference]: Without dead ends: 3023 [2020-02-10 20:42:10,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2020-02-10 20:42:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1593. [2020-02-10 20:42:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:42:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7101 transitions. [2020-02-10 20:42:10,846 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7101 transitions. Word has length 28 [2020-02-10 20:42:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,847 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7101 transitions. [2020-02-10 20:42:10,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7101 transitions. [2020-02-10 20:42:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:10,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:10,849 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash 754676594, now seen corresponding path program 102 times [2020-02-10 20:42:10,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499089763] [2020-02-10 20:42:10,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,333 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:42:11,462 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499089763] [2020-02-10 20:42:11,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:11,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465150879] [2020-02-10 20:42:11,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:11,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:11,474 INFO L87 Difference]: Start difference. First operand 1593 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:42:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:11,657 INFO L93 Difference]: Finished difference Result 3041 states and 11980 transitions. [2020-02-10 20:42:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:11,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:11,665 INFO L225 Difference]: With dead ends: 3041 [2020-02-10 20:42:11,666 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 20:42:11,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 20:42:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1575. [2020-02-10 20:42:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 20:42:11,769 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 20:42:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:11,769 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 20:42:11,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 20:42:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:11,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:11,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:11,773 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash 926102300, now seen corresponding path program 103 times [2020-02-10 20:42:11,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:11,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022900686] [2020-02-10 20:42:11,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:12,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022900686] [2020-02-10 20:42:12,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:12,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:12,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254815788] [2020-02-10 20:42:12,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:12,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:12,330 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:42:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:12,565 INFO L93 Difference]: Finished difference Result 3030 states and 11971 transitions. [2020-02-10 20:42:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:12,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:12,573 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 20:42:12,573 INFO L226 Difference]: Without dead ends: 3014 [2020-02-10 20:42:12,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2020-02-10 20:42:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1589. [2020-02-10 20:42:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:42:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7100 transitions. [2020-02-10 20:42:12,641 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7100 transitions. Word has length 28 [2020-02-10 20:42:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:12,641 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7100 transitions. [2020-02-10 20:42:12,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7100 transitions. [2020-02-10 20:42:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:12,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:12,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:12,644 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1670804798, now seen corresponding path program 104 times [2020-02-10 20:42:12,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:12,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074443738] [2020-02-10 20:42:12,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:13,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074443738] [2020-02-10 20:42:13,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:13,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:13,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446155328] [2020-02-10 20:42:13,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:13,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:13,195 INFO L87 Difference]: Start difference. First operand 1589 states and 7100 transitions. Second operand 11 states. [2020-02-10 20:42:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:13,381 INFO L93 Difference]: Finished difference Result 3034 states and 11972 transitions. [2020-02-10 20:42:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:13,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:13,389 INFO L225 Difference]: With dead ends: 3034 [2020-02-10 20:42:13,390 INFO L226 Difference]: Without dead ends: 3007 [2020-02-10 20:42:13,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-02-10 20:42:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 1582. [2020-02-10 20:42:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:42:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 20:42:13,457 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 20:42:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:13,458 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 20:42:13,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 20:42:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:13,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:13,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:13,460 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2001813456, now seen corresponding path program 105 times [2020-02-10 20:42:13,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:13,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9252551] [2020-02-10 20:42:13,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9252551] [2020-02-10 20:42:14,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:14,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327250318] [2020-02-10 20:42:14,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:14,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:14,014 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:42:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,250 INFO L93 Difference]: Finished difference Result 3026 states and 11957 transitions. [2020-02-10 20:42:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:14,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,258 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:42:14,258 INFO L226 Difference]: Without dead ends: 3010 [2020-02-10 20:42:14,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-02-10 20:42:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1588. [2020-02-10 20:42:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:42:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7091 transitions. [2020-02-10 20:42:14,327 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7091 transitions. Word has length 28 [2020-02-10 20:42:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,328 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7091 transitions. [2020-02-10 20:42:14,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7091 transitions. [2020-02-10 20:42:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:14,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,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] [2020-02-10 20:42:14,330 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1375203650, now seen corresponding path program 106 times [2020-02-10 20:42:14,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364818829] [2020-02-10 20:42:14,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364818829] [2020-02-10 20:42:14,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:14,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164852947] [2020-02-10 20:42:14,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:14,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:14,883 INFO L87 Difference]: Start difference. First operand 1588 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:42:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,071 INFO L93 Difference]: Finished difference Result 3027 states and 11953 transitions. [2020-02-10 20:42:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:15,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,078 INFO L225 Difference]: With dead ends: 3027 [2020-02-10 20:42:15,078 INFO L226 Difference]: Without dead ends: 3004 [2020-02-10 20:42:15,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2020-02-10 20:42:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1582. [2020-02-10 20:42:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:42:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7074 transitions. [2020-02-10 20:42:15,148 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7074 transitions. Word has length 28 [2020-02-10 20:42:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,148 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7074 transitions. [2020-02-10 20:42:15,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7074 transitions. [2020-02-10 20:42:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:15,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:15,151 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 62489616, now seen corresponding path program 107 times [2020-02-10 20:42:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823191276] [2020-02-10 20:42:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823191276] [2020-02-10 20:42:15,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:15,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7356757] [2020-02-10 20:42:15,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:15,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:15,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:15,706 INFO L87 Difference]: Start difference. First operand 1582 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:42:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,877 INFO L93 Difference]: Finished difference Result 3036 states and 11970 transitions. [2020-02-10 20:42:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:15,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,885 INFO L225 Difference]: With dead ends: 3036 [2020-02-10 20:42:15,885 INFO L226 Difference]: Without dead ends: 3016 [2020-02-10 20:42:15,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-02-10 20:42:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1590. [2020-02-10 20:42:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:42:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7088 transitions. [2020-02-10 20:42:15,952 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7088 transitions. Word has length 28 [2020-02-10 20:42:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,952 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7088 transitions. [2020-02-10 20:42:15,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7088 transitions. [2020-02-10 20:42:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:15,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,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] [2020-02-10 20:42:15,955 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash 235737308, now seen corresponding path program 108 times [2020-02-10 20:42:15,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953369914] [2020-02-10 20:42:15,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:16,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953369914] [2020-02-10 20:42:16,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:16,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:16,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099826316] [2020-02-10 20:42:16,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:16,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:16,512 INFO L87 Difference]: Start difference. First operand 1590 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:42:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:16,718 INFO L93 Difference]: Finished difference Result 3033 states and 11957 transitions. [2020-02-10 20:42:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:16,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:16,726 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 20:42:16,726 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 20:42:16,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 20:42:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1575. [2020-02-10 20:42:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7054 transitions. [2020-02-10 20:42:16,793 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7054 transitions. Word has length 28 [2020-02-10 20:42:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:16,793 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7054 transitions. [2020-02-10 20:42:16,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7054 transitions. [2020-02-10 20:42:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:16,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:16,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:16,796 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:16,796 INFO L82 PathProgramCache]: Analyzing trace with hash 936605404, now seen corresponding path program 109 times [2020-02-10 20:42:16,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:16,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350112440] [2020-02-10 20:42:16,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:17,338 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:17,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350112440] [2020-02-10 20:42:17,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:17,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:17,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816751523] [2020-02-10 20:42:17,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:17,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:17,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:17,347 INFO L87 Difference]: Start difference. First operand 1575 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:42:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,589 INFO L93 Difference]: Finished difference Result 3022 states and 11949 transitions. [2020-02-10 20:42:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:17,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,597 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:42:17,598 INFO L226 Difference]: Without dead ends: 3006 [2020-02-10 20:42:17,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2020-02-10 20:42:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1587. [2020-02-10 20:42:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:42:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7088 transitions. [2020-02-10 20:42:17,665 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7088 transitions. Word has length 28 [2020-02-10 20:42:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,665 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7088 transitions. [2020-02-10 20:42:17,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7088 transitions. [2020-02-10 20:42:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:17,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42: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] [2020-02-10 20:42:17,668 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1868956896, now seen corresponding path program 110 times [2020-02-10 20:42:17,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449640438] [2020-02-10 20:42:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:18,207 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:18,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449640438] [2020-02-10 20:42:18,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:18,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402151580] [2020-02-10 20:42:18,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:18,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:18,215 INFO L87 Difference]: Start difference. First operand 1587 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:42:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,448 INFO L93 Difference]: Finished difference Result 3024 states and 11947 transitions. [2020-02-10 20:42:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:18,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,456 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 20:42:18,456 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:42:18,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:42:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1581. [2020-02-10 20:42:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:42:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7071 transitions. [2020-02-10 20:42:18,523 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7071 transitions. Word has length 28 [2020-02-10 20:42:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,523 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7071 transitions. [2020-02-10 20:42:18,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7071 transitions. [2020-02-10 20:42:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:18,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:18,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:18,525 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash 401375602, now seen corresponding path program 111 times [2020-02-10 20:42:18,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128696403] [2020-02-10 20:42:18,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128696403] [2020-02-10 20:42:19,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:19,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472274696] [2020-02-10 20:42:19,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:19,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:19,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:19,089 INFO L87 Difference]: Start difference. First operand 1581 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:42:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:19,280 INFO L93 Difference]: Finished difference Result 3021 states and 11941 transitions. [2020-02-10 20:42:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:19,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:19,287 INFO L225 Difference]: With dead ends: 3021 [2020-02-10 20:42:19,288 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 20:42:19,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 20:42:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1587. [2020-02-10 20:42:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:42:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7082 transitions. [2020-02-10 20:42:19,355 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7082 transitions. Word has length 28 [2020-02-10 20:42:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:19,355 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7082 transitions. [2020-02-10 20:42:19,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7082 transitions. [2020-02-10 20:42:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:19,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:19,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:19,358 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:19,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1319325792, now seen corresponding path program 112 times [2020-02-10 20:42:19,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:19,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994532621] [2020-02-10 20:42:19,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,924 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:42:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994532621] [2020-02-10 20:42:19,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012323773] [2020-02-10 20:42:19,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:19,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:19,932 INFO L87 Difference]: Start difference. First operand 1587 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:42:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,119 INFO L93 Difference]: Finished difference Result 3022 states and 11937 transitions. [2020-02-10 20:42:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:20,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,127 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:42:20,127 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 20:42:20,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 20:42:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1581. [2020-02-10 20:42:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:42:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7065 transitions. [2020-02-10 20:42:20,194 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7065 transitions. Word has length 28 [2020-02-10 20:42:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,194 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7065 transitions. [2020-02-10 20:42:20,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7065 transitions. [2020-02-10 20:42:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:20,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:20,197 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:20,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash 817695218, now seen corresponding path program 113 times [2020-02-10 20:42:20,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795635102] [2020-02-10 20:42:20,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:20,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795635102] [2020-02-10 20:42:20,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:20,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:20,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976416437] [2020-02-10 20:42:20,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:20,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:20,768 INFO L87 Difference]: Start difference. First operand 1581 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:42:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,980 INFO L93 Difference]: Finished difference Result 3026 states and 11946 transitions. [2020-02-10 20:42:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:20,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,987 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:42:20,988 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:42:20,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:42:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1588. [2020-02-10 20:42:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:42:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7078 transitions. [2020-02-10 20:42:21,055 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7078 transitions. Word has length 28 [2020-02-10 20:42:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,055 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7078 transitions. [2020-02-10 20:42:21,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7078 transitions. [2020-02-10 20:42:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:21,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,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] [2020-02-10 20:42:21,058 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash 246240412, now seen corresponding path program 114 times [2020-02-10 20:42:21,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466619523] [2020-02-10 20:42:21,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:21,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466619523] [2020-02-10 20:42:21,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:21,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:21,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333200619] [2020-02-10 20:42:21,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:21,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:21,616 INFO L87 Difference]: Start difference. First operand 1588 states and 7078 transitions. Second operand 11 states. [2020-02-10 20:42:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:21,830 INFO L93 Difference]: Finished difference Result 3025 states and 11937 transitions. [2020-02-10 20:42:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:21,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:21,838 INFO L225 Difference]: With dead ends: 3025 [2020-02-10 20:42:21,838 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:42:21,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:42:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1575. [2020-02-10 20:42:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 20:42:21,907 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 20:42:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,907 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 20:42:21,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 20:42:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:21,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,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] [2020-02-10 20:42:21,909 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1691811006, now seen corresponding path program 115 times [2020-02-10 20:42:21,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903977745] [2020-02-10 20:42:21,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903977745] [2020-02-10 20:42:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:22,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459687240] [2020-02-10 20:42:22,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:22,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:22,476 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:42:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:22,654 INFO L93 Difference]: Finished difference Result 3048 states and 11997 transitions. [2020-02-10 20:42:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:22,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:22,661 INFO L225 Difference]: With dead ends: 3048 [2020-02-10 20:42:22,661 INFO L226 Difference]: Without dead ends: 3028 [2020-02-10 20:42:22,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2020-02-10 20:42:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1595. [2020-02-10 20:42:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-02-10 20:42:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 7098 transitions. [2020-02-10 20:42:22,729 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 7098 transitions. Word has length 28 [2020-02-10 20:42:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:22,729 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 7098 transitions. [2020-02-10 20:42:22,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 7098 transitions. [2020-02-10 20:42:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:22,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:22,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:22,731 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1858453792, now seen corresponding path program 116 times [2020-02-10 20:42:22,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:22,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912079764] [2020-02-10 20:42:22,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:23,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912079764] [2020-02-10 20:42:23,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:23,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:23,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743750439] [2020-02-10 20:42:23,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:23,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:23,289 INFO L87 Difference]: Start difference. First operand 1595 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:42:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,480 INFO L93 Difference]: Finished difference Result 3046 states and 11985 transitions. [2020-02-10 20:42:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:23,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,488 INFO L225 Difference]: With dead ends: 3046 [2020-02-10 20:42:23,488 INFO L226 Difference]: Without dead ends: 3018 [2020-02-10 20:42:23,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-02-10 20:42:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1585. [2020-02-10 20:42:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:42:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 20:42:23,555 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 20:42:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,555 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 20:42:23,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 20:42:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:23,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,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] [2020-02-10 20:42:23,557 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1156581204, now seen corresponding path program 117 times [2020-02-10 20:42:23,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708293881] [2020-02-10 20:42:23,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,130 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:42:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708293881] [2020-02-10 20:42:24,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:24,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752235449] [2020-02-10 20:42:24,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:24,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:24,138 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:42:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,311 INFO L93 Difference]: Finished difference Result 3045 states and 11982 transitions. [2020-02-10 20:42:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:24,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,319 INFO L225 Difference]: With dead ends: 3045 [2020-02-10 20:42:24,319 INFO L226 Difference]: Without dead ends: 3025 [2020-02-10 20:42:24,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2020-02-10 20:42:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1593. [2020-02-10 20:42:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:42:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7086 transitions. [2020-02-10 20:42:24,386 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7086 transitions. Word has length 28 [2020-02-10 20:42:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,386 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7086 transitions. [2020-02-10 20:42:24,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7086 transitions. [2020-02-10 20:42:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:24,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:24,389 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1329828896, now seen corresponding path program 118 times [2020-02-10 20:42:24,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813014465] [2020-02-10 20:42:24,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:25,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813014465] [2020-02-10 20:42:25,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:25,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118175791] [2020-02-10 20:42:25,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:25,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:25,050 INFO L87 Difference]: Start difference. First operand 1593 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:42:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:25,267 INFO L93 Difference]: Finished difference Result 3042 states and 11969 transitions. [2020-02-10 20:42:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:25,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:25,275 INFO L225 Difference]: With dead ends: 3042 [2020-02-10 20:42:25,276 INFO L226 Difference]: Without dead ends: 3017 [2020-02-10 20:42:25,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2020-02-10 20:42:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 1585. [2020-02-10 20:42:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:42:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7064 transitions. [2020-02-10 20:42:25,349 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7064 transitions. Word has length 28 [2020-02-10 20:42:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:25,349 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7064 transitions. [2020-02-10 20:42:25,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7064 transitions. [2020-02-10 20:42:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:25,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:25,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] [2020-02-10 20:42:25,352 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:25,352 INFO L82 PathProgramCache]: Analyzing trace with hash -782742636, now seen corresponding path program 119 times [2020-02-10 20:42:25,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:25,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282242781] [2020-02-10 20:42:25,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,928 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:42:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:25,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282242781] [2020-02-10 20:42:25,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:25,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887629273] [2020-02-10 20:42:25,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:25,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:25,937 INFO L87 Difference]: Start difference. First operand 1585 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:42:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:26,164 INFO L93 Difference]: Finished difference Result 3040 states and 11966 transitions. [2020-02-10 20:42:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:26,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:26,172 INFO L225 Difference]: With dead ends: 3040 [2020-02-10 20:42:26,172 INFO L226 Difference]: Without dead ends: 3022 [2020-02-10 20:42:26,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-02-10 20:42:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1592. [2020-02-10 20:42:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2020-02-10 20:42:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 7077 transitions. [2020-02-10 20:42:26,239 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 7077 transitions. Word has length 28 [2020-02-10 20:42:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:26,239 INFO L479 AbstractCegarLoop]: Abstraction has 1592 states and 7077 transitions. [2020-02-10 20:42:26,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 7077 transitions. [2020-02-10 20:42:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:26,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:26,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:26,243 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:26,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1354197442, now seen corresponding path program 120 times [2020-02-10 20:42:26,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:26,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260110815] [2020-02-10 20:42:26,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:26,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260110815] [2020-02-10 20:42:26,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:26,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:26,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91245534] [2020-02-10 20:42:26,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:26,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:26,804 INFO L87 Difference]: Start difference. First operand 1592 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:42:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,079 INFO L93 Difference]: Finished difference Result 3039 states and 11957 transitions. [2020-02-10 20:42:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:27,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,088 INFO L225 Difference]: With dead ends: 3039 [2020-02-10 20:42:27,088 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:42:27,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:42:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1555. [2020-02-10 20:42:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:42:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 7003 transitions. [2020-02-10 20:42:27,156 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 7003 transitions. Word has length 28 [2020-02-10 20:42:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,156 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 7003 transitions. [2020-02-10 20:42:27,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 7003 transitions. [2020-02-10 20:42:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:27,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:27,159 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1151658060, now seen corresponding path program 121 times [2020-02-10 20:42:27,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829338689] [2020-02-10 20:42:27,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:27,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829338689] [2020-02-10 20:42:27,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:27,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:27,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104403508] [2020-02-10 20:42:27,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:27,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:27,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:27,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:27,717 INFO L87 Difference]: Start difference. First operand 1555 states and 7003 transitions. Second operand 11 states. [2020-02-10 20:42:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,987 INFO L93 Difference]: Finished difference Result 2966 states and 11803 transitions. [2020-02-10 20:42:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:27,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,995 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:42:27,995 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:42:27,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:42:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1579. [2020-02-10 20:42:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:42:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7097 transitions. [2020-02-10 20:42:28,063 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7097 transitions. Word has length 28 [2020-02-10 20:42:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,063 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7097 transitions. [2020-02-10 20:42:28,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7097 transitions. [2020-02-10 20:42:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:28,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:28,066 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1896360558, now seen corresponding path program 122 times [2020-02-10 20:42:28,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42927901] [2020-02-10 20:42:28,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,604 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:42:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42927901] [2020-02-10 20:42:28,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:28,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109402867] [2020-02-10 20:42:28,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:28,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:28,612 INFO L87 Difference]: Start difference. First operand 1579 states and 7097 transitions. Second operand 11 states. [2020-02-10 20:42:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,861 INFO L93 Difference]: Finished difference Result 2967 states and 11800 transitions. [2020-02-10 20:42:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:28,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,869 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:42:28,869 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:42:28,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:42:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1574. [2020-02-10 20:42:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:42:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7083 transitions. [2020-02-10 20:42:28,937 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7083 transitions. Word has length 28 [2020-02-10 20:42:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,937 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7083 transitions. [2020-02-10 20:42:28,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7083 transitions. [2020-02-10 20:42:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:28,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,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] [2020-02-10 20:42:28,940 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1532368278, now seen corresponding path program 123 times [2020-02-10 20:42:28,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853366696] [2020-02-10 20:42:28,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:29,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853366696] [2020-02-10 20:42:29,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:29,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:29,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189840346] [2020-02-10 20:42:29,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:29,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:29,485 INFO L87 Difference]: Start difference. First operand 1574 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:42:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:29,737 INFO L93 Difference]: Finished difference Result 2971 states and 11807 transitions. [2020-02-10 20:42:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:29,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:29,745 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:42:29,745 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:42:29,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:42:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1580. [2020-02-10 20:42:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:42:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7094 transitions. [2020-02-10 20:42:29,813 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7094 transitions. Word has length 28 [2020-02-10 20:42:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:29,813 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7094 transitions. [2020-02-10 20:42:29,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7094 transitions. [2020-02-10 20:42:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:29,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:29,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:29,815 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -42963282, now seen corresponding path program 124 times [2020-02-10 20:42:29,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:29,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172052561] [2020-02-10 20:42:29,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:30,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172052561] [2020-02-10 20:42:30,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:30,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:30,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760800942] [2020-02-10 20:42:30,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:30,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:30,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:30,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:30,365 INFO L87 Difference]: Start difference. First operand 1580 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:42:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:30,578 INFO L93 Difference]: Finished difference Result 2976 states and 11811 transitions. [2020-02-10 20:42:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:30,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:30,586 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:42:30,587 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:42:30,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:42:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1574. [2020-02-10 20:42:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:42:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7077 transitions. [2020-02-10 20:42:30,653 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7077 transitions. Word has length 28 [2020-02-10 20:42:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,653 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7077 transitions. [2020-02-10 20:42:30,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7077 transitions. [2020-02-10 20:42:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:30,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,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] [2020-02-10 20:42:30,656 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 823275178, now seen corresponding path program 125 times [2020-02-10 20:42:30,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159094163] [2020-02-10 20:42:30,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159094163] [2020-02-10 20:42:31,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:31,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485869555] [2020-02-10 20:42:31,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:31,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:31,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:31,216 INFO L87 Difference]: Start difference. First operand 1574 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:42:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,495 INFO L93 Difference]: Finished difference Result 2974 states and 11808 transitions. [2020-02-10 20:42:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:31,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,503 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:42:31,503 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:42:31,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:42:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 20:42:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:42:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7090 transitions. [2020-02-10 20:42:31,569 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7090 transitions. Word has length 28 [2020-02-10 20:42:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,569 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7090 transitions. [2020-02-10 20:42:31,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7090 transitions. [2020-02-10 20:42:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:31,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,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] [2020-02-10 20:42:31,572 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1567977676, now seen corresponding path program 126 times [2020-02-10 20:42:31,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766225153] [2020-02-10 20:42:31,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766225153] [2020-02-10 20:42:32,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:32,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477142803] [2020-02-10 20:42:32,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:32,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:32,114 INFO L87 Difference]: Start difference. First operand 1581 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:42:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:32,291 INFO L93 Difference]: Finished difference Result 2978 states and 11809 transitions. [2020-02-10 20:42:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:32,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:32,299 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:42:32,299 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:42:32,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:42:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1568. [2020-02-10 20:42:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:42:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7060 transitions. [2020-02-10 20:42:32,365 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7060 transitions. Word has length 28 [2020-02-10 20:42:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:32,365 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7060 transitions. [2020-02-10 20:42:32,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7060 transitions. [2020-02-10 20:42:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:32,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:32,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:32,368 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1871670534, now seen corresponding path program 127 times [2020-02-10 20:42:32,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:32,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600987404] [2020-02-10 20:42:32,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600987404] [2020-02-10 20:42:32,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:32,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898981630] [2020-02-10 20:42:32,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:32,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:32,909 INFO L87 Difference]: Start difference. First operand 1568 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:42:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,147 INFO L93 Difference]: Finished difference Result 2961 states and 11787 transitions. [2020-02-10 20:42:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:33,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,156 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:42:33,156 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:42:33,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:42:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1578. [2020-02-10 20:42:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:42:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7088 transitions. [2020-02-10 20:42:33,241 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7088 transitions. Word has length 28 [2020-02-10 20:42:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,242 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7088 transitions. [2020-02-10 20:42:33,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7088 transitions. [2020-02-10 20:42:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:33,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:33,244 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1678594264, now seen corresponding path program 128 times [2020-02-10 20:42:33,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309975548] [2020-02-10 20:42:33,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:33,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309975548] [2020-02-10 20:42:33,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:33,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:33,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171566226] [2020-02-10 20:42:33,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:33,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:33,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:33,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:33,788 INFO L87 Difference]: Start difference. First operand 1578 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:42:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,015 INFO L93 Difference]: Finished difference Result 2962 states and 11784 transitions. [2020-02-10 20:42:34,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:34,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,022 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:42:34,022 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:42:34,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:42:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1573. [2020-02-10 20:42:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:42:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7074 transitions. [2020-02-10 20:42:34,091 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7074 transitions. Word has length 28 [2020-02-10 20:42:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,091 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7074 transitions. [2020-02-10 20:42:34,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7074 transitions. [2020-02-10 20:42:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:34,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:34,094 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 798585154, now seen corresponding path program 129 times [2020-02-10 20:42:34,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043315418] [2020-02-10 20:42:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,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 20:42:34,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043315418] [2020-02-10 20:42:34,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:34,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626875883] [2020-02-10 20:42:34,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:34,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:34,621 INFO L87 Difference]: Start difference. First operand 1573 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:42:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,895 INFO L93 Difference]: Finished difference Result 2963 states and 11786 transitions. [2020-02-10 20:42:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:34,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,903 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:42:34,903 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:42:34,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:42:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 20:42:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:42:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7083 transitions. [2020-02-10 20:42:34,971 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7083 transitions. Word has length 28 [2020-02-10 20:42:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,971 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7083 transitions. [2020-02-10 20:42:34,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7083 transitions. [2020-02-10 20:42:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:34,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:34,974 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1262274648, now seen corresponding path program 130 times [2020-02-10 20:42:34,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360853078] [2020-02-10 20:42:34,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:35,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360853078] [2020-02-10 20:42:35,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:35,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:35,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378612449] [2020-02-10 20:42:35,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:35,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:35,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:35,503 INFO L87 Difference]: Start difference. First operand 1578 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:42:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:35,712 INFO L93 Difference]: Finished difference Result 2966 states and 11787 transitions. [2020-02-10 20:42:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:35,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:35,720 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:42:35,720 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:42:35,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:42:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 20:42:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:42:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7069 transitions. [2020-02-10 20:42:35,786 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7069 transitions. Word has length 28 [2020-02-10 20:42:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:35,786 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7069 transitions. [2020-02-10 20:42:35,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7069 transitions. [2020-02-10 20:42:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:35,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:35,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:35,789 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1140738686, now seen corresponding path program 131 times [2020-02-10 20:42:35,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:35,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961860976] [2020-02-10 20:42:35,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:36,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961860976] [2020-02-10 20:42:36,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:36,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:36,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665828935] [2020-02-10 20:42:36,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:36,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:36,344 INFO L87 Difference]: Start difference. First operand 1573 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:42:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,521 INFO L93 Difference]: Finished difference Result 2966 states and 11788 transitions. [2020-02-10 20:42:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:36,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,529 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:42:36,530 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:42:36,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:42:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1579. [2020-02-10 20:42:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:42:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7080 transitions. [2020-02-10 20:42:36,595 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7080 transitions. Word has length 28 [2020-02-10 20:42:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,596 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7080 transitions. [2020-02-10 20:42:36,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7080 transitions. [2020-02-10 20:42:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:36,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,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] [2020-02-10 20:42:36,598 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash 348666310, now seen corresponding path program 132 times [2020-02-10 20:42:36,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292454966] [2020-02-10 20:42:36,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292454966] [2020-02-10 20:42:37,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:37,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663066997] [2020-02-10 20:42:37,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:37,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:37,131 INFO L87 Difference]: Start difference. First operand 1579 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:42:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,328 INFO L93 Difference]: Finished difference Result 2968 states and 11786 transitions. [2020-02-10 20:42:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:37,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,336 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:42:37,337 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:42:37,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:42:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1568. [2020-02-10 20:42:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:42:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7055 transitions. [2020-02-10 20:42:37,404 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7055 transitions. Word has length 28 [2020-02-10 20:42:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,404 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7055 transitions. [2020-02-10 20:42:37,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7055 transitions. [2020-02-10 20:42:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:37,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,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] [2020-02-10 20:42:37,406 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1882173638, now seen corresponding path program 133 times [2020-02-10 20:42:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464197091] [2020-02-10 20:42:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464197091] [2020-02-10 20:42:37,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:37,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784215345] [2020-02-10 20:42:37,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:37,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:37,936 INFO L87 Difference]: Start difference. First operand 1568 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:42:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,119 INFO L93 Difference]: Finished difference Result 2977 states and 11814 transitions. [2020-02-10 20:42:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:38,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,126 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:42:38,126 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:42:38,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:42:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1581. [2020-02-10 20:42:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:42:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7090 transitions. [2020-02-10 20:42:38,193 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7090 transitions. Word has length 28 [2020-02-10 20:42:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,193 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7090 transitions. [2020-02-10 20:42:38,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7090 transitions. [2020-02-10 20:42:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:38,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,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] [2020-02-10 20:42:38,196 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash -923388662, now seen corresponding path program 134 times [2020-02-10 20:42:38,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030516042] [2020-02-10 20:42:38,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030516042] [2020-02-10 20:42:38,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:38,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628065847] [2020-02-10 20:42:38,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:38,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:38,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:38,746 INFO L87 Difference]: Start difference. First operand 1581 states and 7090 transitions. Second operand 11 states. [2020-02-10 20:42:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,885 INFO L93 Difference]: Finished difference Result 2982 states and 11818 transitions. [2020-02-10 20:42:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:38,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,893 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:42:38,893 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:42:38,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:42:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1575. [2020-02-10 20:42:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7073 transitions. [2020-02-10 20:42:38,960 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7073 transitions. Word has length 28 [2020-02-10 20:42:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,960 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7073 transitions. [2020-02-10 20:42:38,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7073 transitions. [2020-02-10 20:42:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:38,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:38,962 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash -801852700, now seen corresponding path program 135 times [2020-02-10 20:42:38,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951303611] [2020-02-10 20:42:38,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,499 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:42:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951303611] [2020-02-10 20:42:39,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:39,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228193435] [2020-02-10 20:42:39,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:39,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:39,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:39,508 INFO L87 Difference]: Start difference. First operand 1575 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:42:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:39,684 INFO L93 Difference]: Finished difference Result 2974 states and 11803 transitions. [2020-02-10 20:42:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:39,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:39,692 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:42:39,692 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:42:39,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:42:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1580. [2020-02-10 20:42:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:42:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7082 transitions. [2020-02-10 20:42:39,758 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7082 transitions. Word has length 28 [2020-02-10 20:42:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:39,758 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7082 transitions. [2020-02-10 20:42:39,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7082 transitions. [2020-02-10 20:42:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:39,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:39,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] [2020-02-10 20:42:39,762 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1432254794, now seen corresponding path program 136 times [2020-02-10 20:42:39,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:39,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738703443] [2020-02-10 20:42:39,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:40,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738703443] [2020-02-10 20:42:40,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:40,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:40,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831003998] [2020-02-10 20:42:40,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:40,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:40,303 INFO L87 Difference]: Start difference. First operand 1580 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:42:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:40,480 INFO L93 Difference]: Finished difference Result 2977 states and 11804 transitions. [2020-02-10 20:42:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:40,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:40,488 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:42:40,488 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:42:40,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:42:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1575. [2020-02-10 20:42:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7068 transitions. [2020-02-10 20:42:40,555 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7068 transitions. Word has length 28 [2020-02-10 20:42:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,555 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7068 transitions. [2020-02-10 20:42:40,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7068 transitions. [2020-02-10 20:42:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:40,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,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] [2020-02-10 20:42:40,557 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash -385533084, now seen corresponding path program 137 times [2020-02-10 20:42:40,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342565054] [2020-02-10 20:42:40,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,046 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-02-10 20:42:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342565054] [2020-02-10 20:42:41,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:41,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178437477] [2020-02-10 20:42:41,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:41,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:41,166 INFO L87 Difference]: Start difference. First operand 1575 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:42:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,307 INFO L93 Difference]: Finished difference Result 2989 states and 11828 transitions. [2020-02-10 20:42:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:41,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,314 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:42:41,314 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:42:41,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:41,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:42:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1585. [2020-02-10 20:42:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:42:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7085 transitions. [2020-02-10 20:42:41,380 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7085 transitions. Word has length 28 [2020-02-10 20:42:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,381 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7085 transitions. [2020-02-10 20:42:41,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7085 transitions. [2020-02-10 20:42:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:41,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:41,383 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:41,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 359169414, now seen corresponding path program 138 times [2020-02-10 20:42:41,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352628415] [2020-02-10 20:42:41,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352628415] [2020-02-10 20:42:41,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:41,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616534939] [2020-02-10 20:42:41,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:41,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:41,931 INFO L87 Difference]: Start difference. First operand 1585 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:42:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:42,129 INFO L93 Difference]: Finished difference Result 2987 states and 11816 transitions. [2020-02-10 20:42:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:42,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:42,136 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:42:42,136 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:42:42,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:42:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1568. [2020-02-10 20:42:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:42:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7048 transitions. [2020-02-10 20:42:42,203 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7048 transitions. Word has length 28 [2020-02-10 20:42:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:42,203 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7048 transitions. [2020-02-10 20:42:42,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7048 transitions. [2020-02-10 20:42:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:42,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:42,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] [2020-02-10 20:42:42,205 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1657588056, now seen corresponding path program 139 times [2020-02-10 20:42:42,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:42,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907438221] [2020-02-10 20:42:42,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907438221] [2020-02-10 20:42:42,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:42,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34610564] [2020-02-10 20:42:42,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:42,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:42,764 INFO L87 Difference]: Start difference. First operand 1568 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:42:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:42,932 INFO L93 Difference]: Finished difference Result 2984 states and 11826 transitions. [2020-02-10 20:42:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:42,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:42,940 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:42:42,940 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:42:42,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:42:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1583. [2020-02-10 20:42:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:42:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7089 transitions. [2020-02-10 20:42:43,007 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7089 transitions. Word has length 28 [2020-02-10 20:42:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,007 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7089 transitions. [2020-02-10 20:42:43,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7089 transitions. [2020-02-10 20:42:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:43,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,010 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash -912885558, now seen corresponding path program 140 times [2020-02-10 20:42:43,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643173767] [2020-02-10 20:42:43,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:43,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643173767] [2020-02-10 20:42:43,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:43,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:43,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854715605] [2020-02-10 20:42:43,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:43,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:43,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:43,568 INFO L87 Difference]: Start difference. First operand 1583 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:42:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,702 INFO L93 Difference]: Finished difference Result 2988 states and 11827 transitions. [2020-02-10 20:42:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:43,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,710 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:42:43,711 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:42:43,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:42:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1576. [2020-02-10 20:42:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:42:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7069 transitions. [2020-02-10 20:42:43,777 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7069 transitions. Word has length 28 [2020-02-10 20:42:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,778 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7069 transitions. [2020-02-10 20:42:43,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7069 transitions. [2020-02-10 20:42:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:43,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,780 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,780 INFO L82 PathProgramCache]: Analyzing trace with hash -46647098, now seen corresponding path program 141 times [2020-02-10 20:42:43,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346849118] [2020-02-10 20:42:43,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,305 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346849118] [2020-02-10 20:42:44,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:44,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149963729] [2020-02-10 20:42:44,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:44,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:44,314 INFO L87 Difference]: Start difference. First operand 1576 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:42:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:44,486 INFO L93 Difference]: Finished difference Result 2981 states and 11814 transitions. [2020-02-10 20:42:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:44,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:44,493 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:42:44,493 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:42:44,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:42:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1582. [2020-02-10 20:42:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:42:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 20:42:44,560 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 20:42:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:44,560 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 20:42:44,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 20:42:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:44,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:44,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] [2020-02-10 20:42:44,563 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1442757898, now seen corresponding path program 142 times [2020-02-10 20:42:44,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:44,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969040974] [2020-02-10 20:42:44,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969040974] [2020-02-10 20:42:45,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:45,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364538511] [2020-02-10 20:42:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:45,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:45,097 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:42:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:45,308 INFO L93 Difference]: Finished difference Result 2983 states and 11812 transitions. [2020-02-10 20:42:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:45,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:45,316 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:42:45,316 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:42:45,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:42:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1576. [2020-02-10 20:42:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:42:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:42:45,385 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:42:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:45,385 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:42:45,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:42:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:45,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:45,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:45,389 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:45,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:45,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1985970938, now seen corresponding path program 143 times [2020-02-10 20:42:45,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:45,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788841755] [2020-02-10 20:42:45,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788841755] [2020-02-10 20:42:45,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:45,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260130674] [2020-02-10 20:42:45,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:45,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:45,965 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:42:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,115 INFO L93 Difference]: Finished difference Result 2993 states and 11831 transitions. [2020-02-10 20:42:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:46,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,123 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:42:46,123 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:42:46,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:42:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1586. [2020-02-10 20:42:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:42:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7080 transitions. [2020-02-10 20:42:46,190 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7080 transitions. Word has length 28 [2020-02-10 20:42:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,190 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7080 transitions. [2020-02-10 20:42:46,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7080 transitions. [2020-02-10 20:42:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:46,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:46,193 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:46,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1241268440, now seen corresponding path program 144 times [2020-02-10 20:42:46,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:46,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181298912] [2020-02-10 20:42:46,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:46,732 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:42:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:46,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181298912] [2020-02-10 20:42:46,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:46,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:46,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185336036] [2020-02-10 20:42:46,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:46,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:46,741 INFO L87 Difference]: Start difference. First operand 1586 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:42:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,920 INFO L93 Difference]: Finished difference Result 2991 states and 11819 transitions. [2020-02-10 20:42:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:46,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:46,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,930 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:42:46,930 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:42:46,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:42:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1561. [2020-02-10 20:42:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:42:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7029 transitions. [2020-02-10 20:42:46,997 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7029 transitions. Word has length 28 [2020-02-10 20:42:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,997 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7029 transitions. [2020-02-10 20:42:46,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7029 transitions. [2020-02-10 20:42:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:46,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:46,999 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1398945230, now seen corresponding path program 145 times [2020-02-10 20:42:47,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798342790] [2020-02-10 20:42:47,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:47,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798342790] [2020-02-10 20:42:47,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:47,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926311633] [2020-02-10 20:42:47,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:47,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:47,533 INFO L87 Difference]: Start difference. First operand 1561 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:42:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,711 INFO L93 Difference]: Finished difference Result 2946 states and 11739 transitions. [2020-02-10 20:42:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:47,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,719 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:42:47,719 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:42:47,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:42:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1577. [2020-02-10 20:42:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:42:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7083 transitions. [2020-02-10 20:42:47,787 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7083 transitions. Word has length 28 [2020-02-10 20:42:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,787 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7083 transitions. [2020-02-10 20:42:47,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7083 transitions. [2020-02-10 20:42:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:47,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,789 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash -654242732, now seen corresponding path program 146 times [2020-02-10 20:42:47,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780718397] [2020-02-10 20:42:47,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780718397] [2020-02-10 20:42:48,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:48,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408425233] [2020-02-10 20:42:48,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:48,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:48,325 INFO L87 Difference]: Start difference. First operand 1577 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:42:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:48,502 INFO L93 Difference]: Finished difference Result 2947 states and 11736 transitions. [2020-02-10 20:42:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:48,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:48,510 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:42:48,510 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:42:48,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:42:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1572. [2020-02-10 20:42:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:42:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7069 transitions. [2020-02-10 20:42:48,577 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7069 transitions. Word has length 28 [2020-02-10 20:42:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:48,578 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7069 transitions. [2020-02-10 20:42:48,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7069 transitions. [2020-02-10 20:42:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:48,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:48,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] [2020-02-10 20:42:48,580 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash 211995728, now seen corresponding path program 147 times [2020-02-10 20:42:48,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:48,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358180662] [2020-02-10 20:42:48,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:49,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358180662] [2020-02-10 20:42:49,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:49,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:49,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74293541] [2020-02-10 20:42:49,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:49,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:49,108 INFO L87 Difference]: Start difference. First operand 1572 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:42:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,320 INFO L93 Difference]: Finished difference Result 2951 states and 11743 transitions. [2020-02-10 20:42:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:49,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,328 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:42:49,328 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:42:49,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:42:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 20:42:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:42:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7080 transitions. [2020-02-10 20:42:49,394 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7080 transitions. Word has length 28 [2020-02-10 20:42:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,395 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7080 transitions. [2020-02-10 20:42:49,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7080 transitions. [2020-02-10 20:42:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:49,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:49,397 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1701400724, now seen corresponding path program 148 times [2020-02-10 20:42:49,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650813809] [2020-02-10 20:42:49,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:49,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650813809] [2020-02-10 20:42:49,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:49,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:49,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642345999] [2020-02-10 20:42:49,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:49,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:49,933 INFO L87 Difference]: Start difference. First operand 1578 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:42:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,091 INFO L93 Difference]: Finished difference Result 2956 states and 11747 transitions. [2020-02-10 20:42:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:50,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,098 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:42:50,098 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:42:50,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:42:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 20:42:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:42:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7063 transitions. [2020-02-10 20:42:50,165 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7063 transitions. Word has length 28 [2020-02-10 20:42:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,165 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7063 transitions. [2020-02-10 20:42:50,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7063 transitions. [2020-02-10 20:42:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:50,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:50,167 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1727328112, now seen corresponding path program 149 times [2020-02-10 20:42:50,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111159288] [2020-02-10 20:42:50,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111159288] [2020-02-10 20:42:50,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:50,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691125926] [2020-02-10 20:42:50,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:50,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:50,708 INFO L87 Difference]: Start difference. First operand 1572 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:42:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,880 INFO L93 Difference]: Finished difference Result 2954 states and 11744 transitions. [2020-02-10 20:42:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:50,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,888 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:42:50,888 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:42:50,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:42:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1579. [2020-02-10 20:42:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:42:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7076 transitions. [2020-02-10 20:42:50,975 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7076 transitions. Word has length 28 [2020-02-10 20:42:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,975 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7076 transitions. [2020-02-10 20:42:50,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7076 transitions. [2020-02-10 20:42:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:50,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,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] [2020-02-10 20:42:50,978 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash -982625614, now seen corresponding path program 150 times [2020-02-10 20:42:50,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744345886] [2020-02-10 20:42:50,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744345886] [2020-02-10 20:42:51,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:51,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636251532] [2020-02-10 20:42:51,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:51,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:51,521 INFO L87 Difference]: Start difference. First operand 1579 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:42:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,671 INFO L93 Difference]: Finished difference Result 2958 states and 11745 transitions. [2020-02-10 20:42:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:51,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,679 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:42:51,679 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:42:51,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:42:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1566. [2020-02-10 20:42:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:42:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7047 transitions. [2020-02-10 20:42:51,746 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7047 transitions. Word has length 28 [2020-02-10 20:42:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,746 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7047 transitions. [2020-02-10 20:42:51,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7047 transitions. [2020-02-10 20:42:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:51,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:51,748 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:51,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1606068116, now seen corresponding path program 151 times [2020-02-10 20:42:51,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138409327] [2020-02-10 20:42:51,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138409327] [2020-02-10 20:42:52,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:52,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401147648] [2020-02-10 20:42:52,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:52,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:52,273 INFO L87 Difference]: Start difference. First operand 1566 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:42:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:52,456 INFO L93 Difference]: Finished difference Result 2933 states and 11703 transitions. [2020-02-10 20:42:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:52,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:52,464 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:42:52,465 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:42:52,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:42:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1575. [2020-02-10 20:42:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:42:52,533 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:42:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:52,533 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:42:52,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:42:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:52,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:52,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:52,535 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash -861365618, now seen corresponding path program 152 times [2020-02-10 20:42:52,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:52,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871481198] [2020-02-10 20:42:52,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:53,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871481198] [2020-02-10 20:42:53,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:53,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:53,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343572765] [2020-02-10 20:42:53,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:53,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:53,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:53,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:53,068 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:42:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,267 INFO L93 Difference]: Finished difference Result 2934 states and 11700 transitions. [2020-02-10 20:42:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:53,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,275 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:42:53,275 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:42:53,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:42:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1570. [2020-02-10 20:42:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:42:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7058 transitions. [2020-02-10 20:42:53,342 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7058 transitions. Word has length 28 [2020-02-10 20:42:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,342 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7058 transitions. [2020-02-10 20:42:53,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7058 transitions. [2020-02-10 20:42:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:53,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,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] [2020-02-10 20:42:53,345 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2141297918, now seen corresponding path program 153 times [2020-02-10 20:42:53,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188123719] [2020-02-10 20:42:53,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:53,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188123719] [2020-02-10 20:42:53,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:53,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:53,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874794082] [2020-02-10 20:42:53,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:53,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:53,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:53,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:53,901 INFO L87 Difference]: Start difference. First operand 1570 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:42:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,098 INFO L93 Difference]: Finished difference Result 2930 states and 11692 transitions. [2020-02-10 20:42:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:54,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,106 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:42:54,106 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:42:54,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:42:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1574. [2020-02-10 20:42:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:42:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7065 transitions. [2020-02-10 20:42:54,173 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7065 transitions. Word has length 28 [2020-02-10 20:42:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,173 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7065 transitions. [2020-02-10 20:42:54,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7065 transitions. [2020-02-10 20:42:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:54,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:54,176 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1968050226, now seen corresponding path program 154 times [2020-02-10 20:42:54,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002707686] [2020-02-10 20:42:54,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002707686] [2020-02-10 20:42:54,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:54,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521070901] [2020-02-10 20:42:54,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:54,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:54,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:54,712 INFO L87 Difference]: Start difference. First operand 1574 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:42:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,899 INFO L93 Difference]: Finished difference Result 2929 states and 11686 transitions. [2020-02-10 20:42:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:54,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,906 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:42:54,906 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:42:54,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:42:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1570. [2020-02-10 20:42:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:42:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7054 transitions. [2020-02-10 20:42:54,973 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7054 transitions. Word has length 28 [2020-02-10 20:42:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,973 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7054 transitions. [2020-02-10 20:42:54,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7054 transitions. [2020-02-10 20:42:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:54,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,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] [2020-02-10 20:42:54,975 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 214345538, now seen corresponding path program 155 times [2020-02-10 20:42:54,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448965101] [2020-02-10 20:42:54,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:55,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448965101] [2020-02-10 20:42:55,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:55,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:55,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645973379] [2020-02-10 20:42:55,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:55,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:55,499 INFO L87 Difference]: Start difference. First operand 1570 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:42:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:55,700 INFO L93 Difference]: Finished difference Result 2932 states and 11692 transitions. [2020-02-10 20:42:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:55,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:55,715 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:42:55,715 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:42:55,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:42:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1574. [2020-02-10 20:42:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:42:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7061 transitions. [2020-02-10 20:42:55,815 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7061 transitions. Word has length 28 [2020-02-10 20:42:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:55,815 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7061 transitions. [2020-02-10 20:42:55,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7061 transitions. [2020-02-10 20:42:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:55,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:55,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:55,821 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:55,822 INFO L82 PathProgramCache]: Analyzing trace with hash -357109268, now seen corresponding path program 156 times [2020-02-10 20:42:55,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:55,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784244193] [2020-02-10 20:42:55,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,544 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:42:56,701 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:42:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784244193] [2020-02-10 20:42:56,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:56,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931636252] [2020-02-10 20:42:56,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:56,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:56,716 INFO L87 Difference]: Start difference. First operand 1574 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:42:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,898 INFO L93 Difference]: Finished difference Result 2930 states and 11684 transitions. [2020-02-10 20:42:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:56,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,906 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:42:56,907 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:42:56,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:42:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1566. [2020-02-10 20:42:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:42:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7043 transitions. [2020-02-10 20:42:56,976 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7043 transitions. Word has length 28 [2020-02-10 20:42:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,976 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7043 transitions. [2020-02-10 20:42:56,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7043 transitions. [2020-02-10 20:42:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:56,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:56,979 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1595565012, now seen corresponding path program 157 times [2020-02-10 20:42:56,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299292167] [2020-02-10 20:42:56,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:57,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299292167] [2020-02-10 20:42:57,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:57,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:57,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688176760] [2020-02-10 20:42:57,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:57,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:57,500 INFO L87 Difference]: Start difference. First operand 1566 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:42:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,675 INFO L93 Difference]: Finished difference Result 2945 states and 11722 transitions. [2020-02-10 20:42:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:57,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,683 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:42:57,683 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:42:57,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:42:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 20:42:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:42:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 20:42:57,751 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 20:42:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,751 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 20:42:57,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 20:42:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:57,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,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] [2020-02-10 20:42:57,754 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash -106160016, now seen corresponding path program 158 times [2020-02-10 20:42:57,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042269693] [2020-02-10 20:42:57,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:58,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042269693] [2020-02-10 20:42:58,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:58,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:58,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699911102] [2020-02-10 20:42:58,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:58,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:58,281 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:42:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:58,423 INFO L93 Difference]: Finished difference Result 2950 states and 11726 transitions. [2020-02-10 20:42:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:58,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:58,431 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:42:58,432 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:42:58,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:42:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 20:42:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:42:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7056 transitions. [2020-02-10 20:42:58,500 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7056 transitions. Word has length 28 [2020-02-10 20:42:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:58,500 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7056 transitions. [2020-02-10 20:42:58,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7056 transitions. [2020-02-10 20:42:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:58,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:58,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:58,502 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:58,503 INFO L82 PathProgramCache]: Analyzing trace with hash 553231524, now seen corresponding path program 159 times [2020-02-10 20:42:58,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:58,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277992210] [2020-02-10 20:42:58,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:59,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277992210] [2020-02-10 20:42:59,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:59,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654223342] [2020-02-10 20:42:59,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:59,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:59,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:59,032 INFO L87 Difference]: Start difference. First operand 1571 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:42:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:59,258 INFO L93 Difference]: Finished difference Result 2937 states and 11701 transitions. [2020-02-10 20:42:59,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:42:59,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:42:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:59,265 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:42:59,266 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:42:59,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:42:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:42:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1575. [2020-02-10 20:42:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:42:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7063 transitions. [2020-02-10 20:42:59,334 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7063 transitions. Word has length 28 [2020-02-10 20:42:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:59,335 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7063 transitions. [2020-02-10 20:42:59,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:42:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7063 transitions. [2020-02-10 20:42:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:42:59,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:59,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:59,337 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:42:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 726479216, now seen corresponding path program 160 times [2020-02-10 20:42:59,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:59,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265243618] [2020-02-10 20:42:59,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:59,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265243618] [2020-02-10 20:42:59,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:42:59,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812526788] [2020-02-10 20:42:59,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:42:59,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:42:59,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:59,878 INFO L87 Difference]: Start difference. First operand 1575 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:43:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,060 INFO L93 Difference]: Finished difference Result 2936 states and 11695 transitions. [2020-02-10 20:43:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:00,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,067 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:43:00,067 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:43:00,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:43:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1571. [2020-02-10 20:43:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7052 transitions. [2020-02-10 20:43:00,135 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7052 transitions. Word has length 28 [2020-02-10 20:43:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,135 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7052 transitions. [2020-02-10 20:43:00,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7052 transitions. [2020-02-10 20:43:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:00,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:00,138 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash 969551140, now seen corresponding path program 161 times [2020-02-10 20:43:00,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889099656] [2020-02-10 20:43:00,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,648 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:43:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889099656] [2020-02-10 20:43:00,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:00,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263524972] [2020-02-10 20:43:00,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:00,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:00,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:00,656 INFO L87 Difference]: Start difference. First operand 1571 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:43:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,819 INFO L93 Difference]: Finished difference Result 2948 states and 11717 transitions. [2020-02-10 20:43:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:00,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,826 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:43:00,827 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:43:00,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:43:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1576. [2020-02-10 20:43:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:43:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7060 transitions. [2020-02-10 20:43:00,893 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7060 transitions. Word has length 28 [2020-02-10 20:43:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,894 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7060 transitions. [2020-02-10 20:43:00,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7060 transitions. [2020-02-10 20:43:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:00,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:00,896 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash -346606164, now seen corresponding path program 162 times [2020-02-10 20:43:00,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105307267] [2020-02-10 20:43:00,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,324 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-02-10 20:43:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105307267] [2020-02-10 20:43:01,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:01,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568501694] [2020-02-10 20:43:01,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:01,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:01,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:01,445 INFO L87 Difference]: Start difference. First operand 1576 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:43:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:01,675 INFO L93 Difference]: Finished difference Result 2942 states and 11701 transitions. [2020-02-10 20:43:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:01,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:01,683 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:43:01,684 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:43:01,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:43:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1566. [2020-02-10 20:43:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:43:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7038 transitions. [2020-02-10 20:43:01,749 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7038 transitions. Word has length 28 [2020-02-10 20:43:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:01,749 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7038 transitions. [2020-02-10 20:43:01,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7038 transitions. [2020-02-10 20:43:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:01,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:01,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:01,752 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash -840359410, now seen corresponding path program 163 times [2020-02-10 20:43:01,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:01,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120749210] [2020-02-10 20:43:01,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:02,277 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:43:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:02,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120749210] [2020-02-10 20:43:02,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:02,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:02,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548713727] [2020-02-10 20:43:02,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:02,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:02,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:02,286 INFO L87 Difference]: Start difference. First operand 1566 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:43:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:02,502 INFO L93 Difference]: Finished difference Result 2950 states and 11729 transitions. [2020-02-10 20:43:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:02,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,509 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:43:02,509 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:43:02,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:43:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1578. [2020-02-10 20:43:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:43:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7069 transitions. [2020-02-10 20:43:02,575 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7069 transitions. Word has length 28 [2020-02-10 20:43:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,575 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7069 transitions. [2020-02-10 20:43:02,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7069 transitions. [2020-02-10 20:43:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:02,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:02,578 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash -95656912, now seen corresponding path program 164 times [2020-02-10 20:43:02,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167341784] [2020-02-10 20:43:02,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167341784] [2020-02-10 20:43:03,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:03,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356111959] [2020-02-10 20:43:03,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:03,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:03,132 INFO L87 Difference]: Start difference. First operand 1578 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:43:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,322 INFO L93 Difference]: Finished difference Result 2954 states and 11730 transitions. [2020-02-10 20:43:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:03,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,330 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:43:03,330 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:43:03,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:43:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1571. [2020-02-10 20:43:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7051 transitions. [2020-02-10 20:43:03,398 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7051 transitions. Word has length 28 [2020-02-10 20:43:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,398 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7051 transitions. [2020-02-10 20:43:03,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7051 transitions. [2020-02-10 20:43:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:03,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,401 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1308437126, now seen corresponding path program 165 times [2020-02-10 20:43:03,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30787947] [2020-02-10 20:43:03,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,931 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:43:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30787947] [2020-02-10 20:43:03,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:03,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710281515] [2020-02-10 20:43:03,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:03,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:03,940 INFO L87 Difference]: Start difference. First operand 1571 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:43:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,133 INFO L93 Difference]: Finished difference Result 2941 states and 11705 transitions. [2020-02-10 20:43:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:04,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,141 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:43:04,141 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:43:04,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:43:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1575. [2020-02-10 20:43:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7058 transitions. [2020-02-10 20:43:04,209 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7058 transitions. Word has length 28 [2020-02-10 20:43:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,209 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7058 transitions. [2020-02-10 20:43:04,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7058 transitions. [2020-02-10 20:43:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:04,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:04,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:04,212 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash 736982320, now seen corresponding path program 166 times [2020-02-10 20:43:04,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:04,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640236854] [2020-02-10 20:43:04,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640236854] [2020-02-10 20:43:04,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:04,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94411899] [2020-02-10 20:43:04,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:04,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:04,745 INFO L87 Difference]: Start difference. First operand 1575 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:43:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,961 INFO L93 Difference]: Finished difference Result 2939 states and 11697 transitions. [2020-02-10 20:43:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:04,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,969 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:43:04,969 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:43:04,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:43:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 20:43:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7047 transitions. [2020-02-10 20:43:05,037 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7047 transitions. Word has length 28 [2020-02-10 20:43:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:05,037 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7047 transitions. [2020-02-10 20:43:05,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7047 transitions. [2020-02-10 20:43:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:05,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,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] [2020-02-10 20:43:05,040 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash -630886714, now seen corresponding path program 167 times [2020-02-10 20:43:05,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169730363] [2020-02-10 20:43:05,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:05,572 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:43:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:05,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169730363] [2020-02-10 20:43:05,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:05,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:05,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021627609] [2020-02-10 20:43:05,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:05,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:05,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:05,580 INFO L87 Difference]: Start difference. First operand 1571 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:43:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:05,810 INFO L93 Difference]: Finished difference Result 2950 states and 11717 transitions. [2020-02-10 20:43:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:05,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:05,818 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:43:05,818 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:43:05,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:43:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:43:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:43:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7055 transitions. [2020-02-10 20:43:05,885 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7055 transitions. Word has length 28 [2020-02-10 20:43:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:05,885 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7055 transitions. [2020-02-10 20:43:05,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7055 transitions. [2020-02-10 20:43:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:05,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:05,888 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1947044018, now seen corresponding path program 168 times [2020-02-10 20:43:05,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090854672] [2020-02-10 20:43:05,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:06,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090854672] [2020-02-10 20:43:06,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:06,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:06,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000619859] [2020-02-10 20:43:06,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:06,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:06,428 INFO L87 Difference]: Start difference. First operand 1576 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:43:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,652 INFO L93 Difference]: Finished difference Result 2944 states and 11701 transitions. [2020-02-10 20:43:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:06,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,660 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:43:06,660 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:43:06,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:43:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1561. [2020-02-10 20:43:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:43:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7024 transitions. [2020-02-10 20:43:06,726 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7024 transitions. Word has length 28 [2020-02-10 20:43:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,726 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7024 transitions. [2020-02-10 20:43:06,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7024 transitions. [2020-02-10 20:43:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:06,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:06,729 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,729 INFO L82 PathProgramCache]: Analyzing trace with hash -254171636, now seen corresponding path program 169 times [2020-02-10 20:43:06,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132172002] [2020-02-10 20:43:06,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:07,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132172002] [2020-02-10 20:43:07,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:07,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:07,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377192648] [2020-02-10 20:43:07,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:07,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:07,258 INFO L87 Difference]: Start difference. First operand 1561 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:43:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:07,470 INFO L93 Difference]: Finished difference Result 2932 states and 11702 transitions. [2020-02-10 20:43:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:07,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:07,478 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:43:07,478 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:43:07,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:43:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1575. [2020-02-10 20:43:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:43:07,547 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:43:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:07,547 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:43:07,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:43:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:07,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:07,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] [2020-02-10 20:43:07,550 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash 490530862, now seen corresponding path program 170 times [2020-02-10 20:43:07,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:07,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929026337] [2020-02-10 20:43:07,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,082 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:43:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929026337] [2020-02-10 20:43:08,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:08,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477560312] [2020-02-10 20:43:08,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:08,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:08,090 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:43:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:08,327 INFO L93 Difference]: Finished difference Result 2933 states and 11699 transitions. [2020-02-10 20:43:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:08,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:08,334 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:43:08,335 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:43:08,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:43:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1570. [2020-02-10 20:43:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:43:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7057 transitions. [2020-02-10 20:43:08,402 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7057 transitions. Word has length 28 [2020-02-10 20:43:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:08,402 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7057 transitions. [2020-02-10 20:43:08,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7057 transitions. [2020-02-10 20:43:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:08,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:08,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:08,405 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1327257016, now seen corresponding path program 171 times [2020-02-10 20:43:08,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:08,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131027277] [2020-02-10 20:43:08,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131027277] [2020-02-10 20:43:08,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:08,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315898844] [2020-02-10 20:43:08,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:08,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:08,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:08,933 INFO L87 Difference]: Start difference. First operand 1570 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:43:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,128 INFO L93 Difference]: Finished difference Result 2934 states and 11701 transitions. [2020-02-10 20:43:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:09,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,135 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:43:09,136 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:43:09,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:43:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1575. [2020-02-10 20:43:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 20:43:09,202 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 20:43:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,202 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 20:43:09,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 20:43:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:09,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,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] [2020-02-10 20:43:09,205 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 906850478, now seen corresponding path program 172 times [2020-02-10 20:43:09,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500867855] [2020-02-10 20:43:09,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:09,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500867855] [2020-02-10 20:43:09,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:09,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:09,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191047562] [2020-02-10 20:43:09,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:09,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:09,721 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:43:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,925 INFO L93 Difference]: Finished difference Result 2937 states and 11702 transitions. [2020-02-10 20:43:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:09,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,933 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:43:09,933 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:43:09,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:43:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 20:43:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:43:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:43:10,001 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:43:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:10,002 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:43:10,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:43:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:10,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:10,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:10,004 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1028386440, now seen corresponding path program 173 times [2020-02-10 20:43:10,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:10,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349773253] [2020-02-10 20:43:10,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349773253] [2020-02-10 20:43:10,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:10,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884203792] [2020-02-10 20:43:10,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:10,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:10,528 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:43:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:10,747 INFO L93 Difference]: Finished difference Result 2937 states and 11703 transitions. [2020-02-10 20:43:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:10,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:10,755 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:43:10,755 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:43:10,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:43:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1576. [2020-02-10 20:43:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:43:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:43:10,823 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:43:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:10,823 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:43:10,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:43:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:10,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:10,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] [2020-02-10 20:43:10,826 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1777175860, now seen corresponding path program 174 times [2020-02-10 20:43:10,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:10,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199519083] [2020-02-10 20:43:10,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:11,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199519083] [2020-02-10 20:43:11,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:11,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:11,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768420416] [2020-02-10 20:43:11,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:11,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:11,351 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:43:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,527 INFO L93 Difference]: Finished difference Result 2939 states and 11701 transitions. [2020-02-10 20:43:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:11,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,535 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:43:11,535 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:43:11,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:43:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1565. [2020-02-10 20:43:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:43:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7039 transitions. [2020-02-10 20:43:11,632 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7039 transitions. Word has length 28 [2020-02-10 20:43:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,632 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7039 transitions. [2020-02-10 20:43:11,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7039 transitions. [2020-02-10 20:43:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:11,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:11,635 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash -760517902, now seen corresponding path program 175 times [2020-02-10 20:43:11,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860552171] [2020-02-10 20:43:11,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860552171] [2020-02-10 20:43:12,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:12,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8476382] [2020-02-10 20:43:12,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:12,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:12,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:12,173 INFO L87 Difference]: Start difference. First operand 1565 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:43:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:12,365 INFO L93 Difference]: Finished difference Result 2924 states and 11677 transitions. [2020-02-10 20:43:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:12,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:12,372 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:43:12,372 INFO L226 Difference]: Without dead ends: 2909 [2020-02-10 20:43:12,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2020-02-10 20:43:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1574. [2020-02-10 20:43:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:43:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 20:43:12,439 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 20:43:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:12,439 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 20:43:12,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 20:43:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:12,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:12,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:12,442 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash -15815404, now seen corresponding path program 176 times [2020-02-10 20:43:12,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:12,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570614017] [2020-02-10 20:43:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570614017] [2020-02-10 20:43:12,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:12,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103017440] [2020-02-10 20:43:12,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:12,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:12,976 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:43:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,169 INFO L93 Difference]: Finished difference Result 2925 states and 11674 transitions. [2020-02-10 20:43:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:13,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,176 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:43:13,176 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:43:13,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:43:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 20:43:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:43:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7050 transitions. [2020-02-10 20:43:13,244 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7050 transitions. Word has length 28 [2020-02-10 20:43:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,244 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7050 transitions. [2020-02-10 20:43:13,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7050 transitions. [2020-02-10 20:43:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:13,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,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] [2020-02-10 20:43:13,247 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1295747704, now seen corresponding path program 177 times [2020-02-10 20:43:13,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143382830] [2020-02-10 20:43:13,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:13,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143382830] [2020-02-10 20:43:13,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:13,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:13,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935641652] [2020-02-10 20:43:13,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:13,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:13,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:13,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:13,787 INFO L87 Difference]: Start difference. First operand 1569 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:43:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,970 INFO L93 Difference]: Finished difference Result 2921 states and 11666 transitions. [2020-02-10 20:43:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:13,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,977 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:43:13,977 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:43:13,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:43:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1573. [2020-02-10 20:43:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:43:14,043 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:43:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,043 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:43:14,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:43:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:14,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:14,046 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1122500012, now seen corresponding path program 178 times [2020-02-10 20:43:14,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318524033] [2020-02-10 20:43:14,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318524033] [2020-02-10 20:43:14,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:14,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673563894] [2020-02-10 20:43:14,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:14,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:14,584 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:43:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:14,780 INFO L93 Difference]: Finished difference Result 2920 states and 11660 transitions. [2020-02-10 20:43:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:14,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:14,789 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:43:14,789 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:43:14,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:43:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1569. [2020-02-10 20:43:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:43:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7046 transitions. [2020-02-10 20:43:14,857 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7046 transitions. Word has length 28 [2020-02-10 20:43:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,857 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7046 transitions. [2020-02-10 20:43:14,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7046 transitions. [2020-02-10 20:43:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:14,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,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] [2020-02-10 20:43:14,859 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1059895752, now seen corresponding path program 179 times [2020-02-10 20:43:14,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262424268] [2020-02-10 20:43:14,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:15,387 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:15,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262424268] [2020-02-10 20:43:15,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:15,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:15,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160735341] [2020-02-10 20:43:15,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:15,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:15,395 INFO L87 Difference]: Start difference. First operand 1569 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:43:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,593 INFO L93 Difference]: Finished difference Result 2923 states and 11666 transitions. [2020-02-10 20:43:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:15,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,601 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:43:15,601 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:43:15,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:43:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1573. [2020-02-10 20:43:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 20:43:15,668 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 20:43:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,668 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 20:43:15,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 20:43:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:15,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:15,671 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash 488440946, now seen corresponding path program 180 times [2020-02-10 20:43:15,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237542914] [2020-02-10 20:43:15,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,207 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:16,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237542914] [2020-02-10 20:43:16,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317329120] [2020-02-10 20:43:16,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:16,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:16,216 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:43:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:16,410 INFO L93 Difference]: Finished difference Result 2921 states and 11658 transitions. [2020-02-10 20:43:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:16,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:16,418 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:43:16,418 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:43:16,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:43:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1565. [2020-02-10 20:43:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:43:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7035 transitions. [2020-02-10 20:43:16,484 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7035 transitions. Word has length 28 [2020-02-10 20:43:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:16,485 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7035 transitions. [2020-02-10 20:43:16,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7035 transitions. [2020-02-10 20:43:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:16,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:16,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:16,487 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash -739511694, now seen corresponding path program 181 times [2020-02-10 20:43:16,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:16,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92017902] [2020-02-10 20:43:16,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,920 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-02-10 20:43:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92017902] [2020-02-10 20:43:17,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:17,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860616323] [2020-02-10 20:43:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:17,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:17,041 INFO L87 Difference]: Start difference. First operand 1565 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:43:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:17,226 INFO L93 Difference]: Finished difference Result 2928 states and 11681 transitions. [2020-02-10 20:43:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:17,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:17,235 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:43:17,235 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:43:17,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:43:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1574. [2020-02-10 20:43:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:43:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 20:43:17,308 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 20:43:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:17,308 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 20:43:17,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 20:43:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:17,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:17,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:17,311 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1494595800, now seen corresponding path program 182 times [2020-02-10 20:43:17,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:17,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213633794] [2020-02-10 20:43:17,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213633794] [2020-02-10 20:43:17,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:17,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133751521] [2020-02-10 20:43:17,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:17,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:17,824 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:43:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,034 INFO L93 Difference]: Finished difference Result 2931 states and 11682 transitions. [2020-02-10 20:43:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:18,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,041 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:43:18,041 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:43:18,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:43:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1569. [2020-02-10 20:43:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:43:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7046 transitions. [2020-02-10 20:43:18,107 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7046 transitions. Word has length 28 [2020-02-10 20:43:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,108 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7046 transitions. [2020-02-10 20:43:18,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7046 transitions. [2020-02-10 20:43:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:18,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,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] [2020-02-10 20:43:18,110 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash -201656116, now seen corresponding path program 183 times [2020-02-10 20:43:18,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132502880] [2020-02-10 20:43:18,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:18,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132502880] [2020-02-10 20:43:18,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:18,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:18,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519291360] [2020-02-10 20:43:18,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:18,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:18,639 INFO L87 Difference]: Start difference. First operand 1569 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:43:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,825 INFO L93 Difference]: Finished difference Result 2923 states and 11666 transitions. [2020-02-10 20:43:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:18,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,833 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:43:18,833 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:43:18,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:43:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1573. [2020-02-10 20:43:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 20:43:18,902 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 20:43:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,902 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 20:43:18,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 20:43:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:18,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:18,905 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -28408424, now seen corresponding path program 184 times [2020-02-10 20:43:18,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296474925] [2020-02-10 20:43:18,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296474925] [2020-02-10 20:43:19,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:19,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898690124] [2020-02-10 20:43:19,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:19,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:19,435 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:43:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,653 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 20:43:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:19,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,661 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:43:19,661 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:43:19,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:43:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 20:43:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:43:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7042 transitions. [2020-02-10 20:43:19,728 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7042 transitions. Word has length 28 [2020-02-10 20:43:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,728 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7042 transitions. [2020-02-10 20:43:19,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7042 transitions. [2020-02-10 20:43:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:19,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:19,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:19,731 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1724660340, now seen corresponding path program 185 times [2020-02-10 20:43:19,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358671356] [2020-02-10 20:43:19,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,252 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:43:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:20,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358671356] [2020-02-10 20:43:20,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:20,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474511690] [2020-02-10 20:43:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:20,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:20,260 INFO L87 Difference]: Start difference. First operand 1569 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:43:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:20,480 INFO L93 Difference]: Finished difference Result 2929 states and 11674 transitions. [2020-02-10 20:43:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:20,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:20,488 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:43:20,488 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:43:20,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:43:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1573. [2020-02-10 20:43:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 20:43:20,556 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 20:43:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:20,556 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 20:43:20,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 20:43:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:20,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:20,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:20,559 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 509447154, now seen corresponding path program 186 times [2020-02-10 20:43:20,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:20,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854633887] [2020-02-10 20:43:20,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854633887] [2020-02-10 20:43:21,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:21,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728181545] [2020-02-10 20:43:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:21,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:21,086 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:43:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,335 INFO L93 Difference]: Finished difference Result 2925 states and 11662 transitions. [2020-02-10 20:43:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:21,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,343 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:43:21,343 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:43:21,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:43:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1565. [2020-02-10 20:43:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:43:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7031 transitions. [2020-02-10 20:43:21,410 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7031 transitions. Word has length 28 [2020-02-10 20:43:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,410 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7031 transitions. [2020-02-10 20:43:21,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7031 transitions. [2020-02-10 20:43:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:21,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,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] [2020-02-10 20:43:21,412 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,413 INFO L82 PathProgramCache]: Analyzing trace with hash 15693908, now seen corresponding path program 187 times [2020-02-10 20:43:21,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105650859] [2020-02-10 20:43:21,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105650859] [2020-02-10 20:43:21,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:21,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017468594] [2020-02-10 20:43:21,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:21,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:21,923 INFO L87 Difference]: Start difference. First operand 1565 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:43:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,125 INFO L93 Difference]: Finished difference Result 2933 states and 11689 transitions. [2020-02-10 20:43:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:22,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,133 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:43:22,134 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:43:22,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:43:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1575. [2020-02-10 20:43:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7057 transitions. [2020-02-10 20:43:22,201 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7057 transitions. Word has length 28 [2020-02-10 20:43:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,201 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7057 transitions. [2020-02-10 20:43:22,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7057 transitions. [2020-02-10 20:43:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:22,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,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] [2020-02-10 20:43:22,204 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1505098904, now seen corresponding path program 188 times [2020-02-10 20:43:22,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307909761] [2020-02-10 20:43:22,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307909761] [2020-02-10 20:43:22,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:22,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665165502] [2020-02-10 20:43:22,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:22,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:22,726 INFO L87 Difference]: Start difference. First operand 1575 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:43:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,913 INFO L93 Difference]: Finished difference Result 2935 states and 11687 transitions. [2020-02-10 20:43:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:22,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,920 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:43:22,920 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:43:22,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:43:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1569. [2020-02-10 20:43:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:43:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7042 transitions. [2020-02-10 20:43:22,989 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7042 transitions. Word has length 28 [2020-02-10 20:43:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,989 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7042 transitions. [2020-02-10 20:43:22,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7042 transitions. [2020-02-10 20:43:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:22,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,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] [2020-02-10 20:43:22,991 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash 553549486, now seen corresponding path program 189 times [2020-02-10 20:43:22,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008101901] [2020-02-10 20:43:22,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:23,533 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:23,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008101901] [2020-02-10 20:43:23,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:23,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:23,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20026083] [2020-02-10 20:43:23,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:23,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:23,540 INFO L87 Difference]: Start difference. First operand 1569 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:43:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:23,744 INFO L93 Difference]: Finished difference Result 2927 states and 11671 transitions. [2020-02-10 20:43:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:23,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:23,752 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:43:23,752 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:43:23,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:43:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1573. [2020-02-10 20:43:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 20:43:23,818 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 20:43:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:23,819 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 20:43:23,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 20:43:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:23,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:23,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:23,821 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash -17905320, now seen corresponding path program 190 times [2020-02-10 20:43:23,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:23,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822410927] [2020-02-10 20:43:23,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:24,331 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:24,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822410927] [2020-02-10 20:43:24,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:24,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:24,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136070918] [2020-02-10 20:43:24,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:24,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:24,339 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:43:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,606 INFO L93 Difference]: Finished difference Result 2925 states and 11663 transitions. [2020-02-10 20:43:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:24,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,613 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:43:24,613 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:43:24,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:43:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1569. [2020-02-10 20:43:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:43:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7038 transitions. [2020-02-10 20:43:24,680 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7038 transitions. Word has length 28 [2020-02-10 20:43:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,680 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7038 transitions. [2020-02-10 20:43:24,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7038 transitions. [2020-02-10 20:43:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:24,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,682 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash 969869102, now seen corresponding path program 191 times [2020-02-10 20:43:24,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895701100] [2020-02-10 20:43:24,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895701100] [2020-02-10 20:43:25,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:25,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181626141] [2020-02-10 20:43:25,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:25,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:25,199 INFO L87 Difference]: Start difference. First operand 1569 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:43:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,446 INFO L93 Difference]: Finished difference Result 2931 states and 11675 transitions. [2020-02-10 20:43:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:25,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,455 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:43:25,455 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:43:25,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:43:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1573. [2020-02-10 20:43:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 20:43:25,526 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 20:43:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,526 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 20:43:25,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 20:43:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:25,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,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] [2020-02-10 20:43:25,529 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1090990700, now seen corresponding path program 192 times [2020-02-10 20:43:25,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449976836] [2020-02-10 20:43:25,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,064 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449976836] [2020-02-10 20:43:26,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:26,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802326018] [2020-02-10 20:43:26,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:26,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:26,072 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:43:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,258 INFO L93 Difference]: Finished difference Result 2927 states and 11663 transitions. [2020-02-10 20:43:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:26,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,266 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:43:26,266 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:43:26,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:43:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1561. [2020-02-10 20:43:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:43:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7020 transitions. [2020-02-10 20:43:26,333 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7020 transitions. Word has length 28 [2020-02-10 20:43:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,333 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7020 transitions. [2020-02-10 20:43:26,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7020 transitions. [2020-02-10 20:43:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:26,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:26,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:26,335 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1682365546, now seen corresponding path program 193 times [2020-02-10 20:43:26,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:26,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446411882] [2020-02-10 20:43:26,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446411882] [2020-02-10 20:43:26,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:26,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630726364] [2020-02-10 20:43:26,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:26,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:26,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:26,867 INFO L87 Difference]: Start difference. First operand 1561 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:43:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,055 INFO L93 Difference]: Finished difference Result 2965 states and 11770 transitions. [2020-02-10 20:43:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:27,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,062 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:43:27,063 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:43:27,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:43:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 20:43:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:43:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7081 transitions. [2020-02-10 20:43:27,129 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7081 transitions. Word has length 28 [2020-02-10 20:43:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,130 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7081 transitions. [2020-02-10 20:43:27,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7081 transitions. [2020-02-10 20:43:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:27,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,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] [2020-02-10 20:43:27,132 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1123196754, now seen corresponding path program 194 times [2020-02-10 20:43:27,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654192391] [2020-02-10 20:43:27,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:27,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654192391] [2020-02-10 20:43:27,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:27,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:27,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135887397] [2020-02-10 20:43:27,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:27,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:27,692 INFO L87 Difference]: Start difference. First operand 1580 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:43:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,865 INFO L93 Difference]: Finished difference Result 2970 states and 11774 transitions. [2020-02-10 20:43:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:27,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,872 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:43:27,872 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:43:27,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:43:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1574. [2020-02-10 20:43:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:43:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7064 transitions. [2020-02-10 20:43:27,938 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7064 transitions. Word has length 28 [2020-02-10 20:43:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,938 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7064 transitions. [2020-02-10 20:43:27,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7064 transitions. [2020-02-10 20:43:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:27,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,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] [2020-02-10 20:43:27,940 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1001660792, now seen corresponding path program 195 times [2020-02-10 20:43:27,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543779454] [2020-02-10 20:43:27,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,469 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:43:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:28,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543779454] [2020-02-10 20:43:28,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:28,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090874598] [2020-02-10 20:43:28,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:28,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:28,477 INFO L87 Difference]: Start difference. First operand 1574 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:43:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,702 INFO L93 Difference]: Finished difference Result 2962 states and 11759 transitions. [2020-02-10 20:43:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:28,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,709 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:43:28,709 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:43:28,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:43:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1579. [2020-02-10 20:43:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:43:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7073 transitions. [2020-02-10 20:43:28,778 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7073 transitions. Word has length 28 [2020-02-10 20:43:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,778 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7073 transitions. [2020-02-10 20:43:28,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7073 transitions. [2020-02-10 20:43:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:28,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:28,781 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1232446702, now seen corresponding path program 196 times [2020-02-10 20:43:28,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408953356] [2020-02-10 20:43:28,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408953356] [2020-02-10 20:43:29,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:29,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77850193] [2020-02-10 20:43:29,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:29,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:29,315 INFO L87 Difference]: Start difference. First operand 1579 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:43:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,495 INFO L93 Difference]: Finished difference Result 2965 states and 11760 transitions. [2020-02-10 20:43:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:29,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,503 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:43:29,504 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:43:29,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:43:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1574. [2020-02-10 20:43:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:43:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 20:43:29,571 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 20:43:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:29,572 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 20:43:29,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 20:43:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:29,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:29,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:29,574 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:29,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash -585341176, now seen corresponding path program 197 times [2020-02-10 20:43:29,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:29,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665995884] [2020-02-10 20:43:29,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665995884] [2020-02-10 20:43:30,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:30,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338297168] [2020-02-10 20:43:30,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:30,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:30,128 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:43:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:30,271 INFO L93 Difference]: Finished difference Result 2977 states and 11784 transitions. [2020-02-10 20:43:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:30,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:30,279 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:43:30,279 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:43:30,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:43:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1584. [2020-02-10 20:43:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:43:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7076 transitions. [2020-02-10 20:43:30,346 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7076 transitions. Word has length 28 [2020-02-10 20:43:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,347 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7076 transitions. [2020-02-10 20:43:30,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7076 transitions. [2020-02-10 20:43:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:30,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:30,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:30,349 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 159361322, now seen corresponding path program 198 times [2020-02-10 20:43:30,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113562057] [2020-02-10 20:43:30,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113562057] [2020-02-10 20:43:30,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:30,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501121384] [2020-02-10 20:43:30,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:30,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:30,885 INFO L87 Difference]: Start difference. First operand 1584 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:43:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,095 INFO L93 Difference]: Finished difference Result 2975 states and 11772 transitions. [2020-02-10 20:43:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:31,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,103 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:43:31,103 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:43:31,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:43:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1567. [2020-02-10 20:43:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:43:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7040 transitions. [2020-02-10 20:43:31,170 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7040 transitions. Word has length 28 [2020-02-10 20:43:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,171 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7040 transitions. [2020-02-10 20:43:31,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7040 transitions. [2020-02-10 20:43:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:31,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:31,173 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1176019280, now seen corresponding path program 199 times [2020-02-10 20:43:31,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687639499] [2020-02-10 20:43:31,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687639499] [2020-02-10 20:43:31,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:31,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591358757] [2020-02-10 20:43:31,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:31,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:31,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:31,709 INFO L87 Difference]: Start difference. First operand 1567 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:43:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,917 INFO L93 Difference]: Finished difference Result 2953 states and 11734 transitions. [2020-02-10 20:43:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:31,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,923 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:43:31,924 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:43:31,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:43:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1578. [2020-02-10 20:43:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:43:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7069 transitions. [2020-02-10 20:43:31,990 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7069 transitions. Word has length 28 [2020-02-10 20:43:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,990 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7069 transitions. [2020-02-10 20:43:31,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7069 transitions. [2020-02-10 20:43:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:31,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,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] [2020-02-10 20:43:31,993 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1629543020, now seen corresponding path program 200 times [2020-02-10 20:43:31,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112289423] [2020-02-10 20:43:31,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112289423] [2020-02-10 20:43:32,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:32,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413720713] [2020-02-10 20:43:32,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:32,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:32,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:32,513 INFO L87 Difference]: Start difference. First operand 1578 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:43:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:32,664 INFO L93 Difference]: Finished difference Result 2958 states and 11738 transitions. [2020-02-10 20:43:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:32,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:32,672 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:43:32,673 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:43:32,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:43:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1572. [2020-02-10 20:43:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:43:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7053 transitions. [2020-02-10 20:43:32,739 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7053 transitions. Word has length 28 [2020-02-10 20:43:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:32,739 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7053 transitions. [2020-02-10 20:43:32,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7053 transitions. [2020-02-10 20:43:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:32,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:32,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:32,742 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash -970151480, now seen corresponding path program 201 times [2020-02-10 20:43:32,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:32,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069103868] [2020-02-10 20:43:32,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:33,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069103868] [2020-02-10 20:43:33,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:33,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:33,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095901835] [2020-02-10 20:43:33,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:33,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:33,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:33,262 INFO L87 Difference]: Start difference. First operand 1572 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:43:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,474 INFO L93 Difference]: Finished difference Result 2945 states and 11713 transitions. [2020-02-10 20:43:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:33,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,481 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:43:33,482 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:43:33,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:43:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:43:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:43:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7060 transitions. [2020-02-10 20:43:33,549 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7060 transitions. Word has length 28 [2020-02-10 20:43:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,549 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7060 transitions. [2020-02-10 20:43:33,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7060 transitions. [2020-02-10 20:43:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:33,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:33,551 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash -796903788, now seen corresponding path program 202 times [2020-02-10 20:43:33,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160028932] [2020-02-10 20:43:33,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,073 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:43:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160028932] [2020-02-10 20:43:34,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:34,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323769996] [2020-02-10 20:43:34,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:34,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:34,081 INFO L87 Difference]: Start difference. First operand 1576 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:43:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,274 INFO L93 Difference]: Finished difference Result 2944 states and 11707 transitions. [2020-02-10 20:43:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:34,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,282 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:43:34,282 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:43:34,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:43:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1572. [2020-02-10 20:43:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:43:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7049 transitions. [2020-02-10 20:43:34,350 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7049 transitions. Word has length 28 [2020-02-10 20:43:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,350 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7049 transitions. [2020-02-10 20:43:34,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7049 transitions. [2020-02-10 20:43:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:34,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:34,353 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,353 INFO L82 PathProgramCache]: Analyzing trace with hash -553831864, now seen corresponding path program 203 times [2020-02-10 20:43:34,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735034385] [2020-02-10 20:43:34,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735034385] [2020-02-10 20:43:34,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:34,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706143111] [2020-02-10 20:43:34,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:34,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:34,875 INFO L87 Difference]: Start difference. First operand 1572 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:43:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,039 INFO L93 Difference]: Finished difference Result 2956 states and 11729 transitions. [2020-02-10 20:43:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:35,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,047 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:43:35,047 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:43:35,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:43:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1577. [2020-02-10 20:43:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:43:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7057 transitions. [2020-02-10 20:43:35,113 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7057 transitions. Word has length 28 [2020-02-10 20:43:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,114 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7057 transitions. [2020-02-10 20:43:35,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7057 transitions. [2020-02-10 20:43:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:35,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,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] [2020-02-10 20:43:35,116 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1869989168, now seen corresponding path program 204 times [2020-02-10 20:43:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437999160] [2020-02-10 20:43:35,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437999160] [2020-02-10 20:43:35,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:35,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075548210] [2020-02-10 20:43:35,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:35,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:35,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:35,634 INFO L87 Difference]: Start difference. First operand 1577 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:43:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,822 INFO L93 Difference]: Finished difference Result 2950 states and 11713 transitions. [2020-02-10 20:43:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:35,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,830 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:43:35,830 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:43:35,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:43:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1567. [2020-02-10 20:43:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:43:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7035 transitions. [2020-02-10 20:43:35,897 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7035 transitions. Word has length 28 [2020-02-10 20:43:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,897 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7035 transitions. [2020-02-10 20:43:35,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7035 transitions. [2020-02-10 20:43:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:35,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:35,900 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1186522384, now seen corresponding path program 205 times [2020-02-10 20:43:35,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84675104] [2020-02-10 20:43:35,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:36,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84675104] [2020-02-10 20:43:36,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:36,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:36,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090974191] [2020-02-10 20:43:36,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:36,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:36,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:36,425 INFO L87 Difference]: Start difference. First operand 1567 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:43:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,616 INFO L93 Difference]: Finished difference Result 2945 states and 11714 transitions. [2020-02-10 20:43:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:36,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,623 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:43:36,623 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:43:36,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:43:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:43:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:43:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7059 transitions. [2020-02-10 20:43:36,702 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7059 transitions. Word has length 28 [2020-02-10 20:43:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,702 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7059 transitions. [2020-02-10 20:43:36,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7059 transitions. [2020-02-10 20:43:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:36,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:36,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:36,704 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,705 INFO L82 PathProgramCache]: Analyzing trace with hash -874337418, now seen corresponding path program 206 times [2020-02-10 20:43:36,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016090976] [2020-02-10 20:43:36,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016090976] [2020-02-10 20:43:37,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:37,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426481559] [2020-02-10 20:43:37,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:37,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:37,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:37,234 INFO L87 Difference]: Start difference. First operand 1576 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:43:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,433 INFO L93 Difference]: Finished difference Result 2948 states and 11715 transitions. [2020-02-10 20:43:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:37,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,441 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:43:37,441 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:43:37,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:43:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:43:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7046 transitions. [2020-02-10 20:43:37,508 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7046 transitions. Word has length 28 [2020-02-10 20:43:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,508 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7046 transitions. [2020-02-10 20:43:37,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7046 transitions. [2020-02-10 20:43:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:37,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:37,511 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1724377962, now seen corresponding path program 207 times [2020-02-10 20:43:37,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218699530] [2020-02-10 20:43:37,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218699530] [2020-02-10 20:43:38,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:38,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908817061] [2020-02-10 20:43:38,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:38,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:38,059 INFO L87 Difference]: Start difference. First operand 1571 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:43:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:38,326 INFO L93 Difference]: Finished difference Result 2940 states and 11699 transitions. [2020-02-10 20:43:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:38,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:38,334 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:43:38,334 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:43:38,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:43:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1575. [2020-02-10 20:43:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7053 transitions. [2020-02-10 20:43:38,401 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7053 transitions. Word has length 28 [2020-02-10 20:43:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:38,401 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7053 transitions. [2020-02-10 20:43:38,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7053 transitions. [2020-02-10 20:43:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:38,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:38,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] [2020-02-10 20:43:38,404 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1897625654, now seen corresponding path program 208 times [2020-02-10 20:43:38,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:38,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596289780] [2020-02-10 20:43:38,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596289780] [2020-02-10 20:43:38,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:38,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901283717] [2020-02-10 20:43:38,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:38,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:38,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:38,921 INFO L87 Difference]: Start difference. First operand 1575 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:43:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,135 INFO L93 Difference]: Finished difference Result 2939 states and 11693 transitions. [2020-02-10 20:43:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:39,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,143 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:43:39,143 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:43:39,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:43:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 20:43:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7042 transitions. [2020-02-10 20:43:39,210 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7042 transitions. Word has length 28 [2020-02-10 20:43:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:39,210 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7042 transitions. [2020-02-10 20:43:39,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7042 transitions. [2020-02-10 20:43:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:39,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:39,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:39,213 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash 201373738, now seen corresponding path program 209 times [2020-02-10 20:43:39,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143536795] [2020-02-10 20:43:39,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:39,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143536795] [2020-02-10 20:43:39,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:39,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:39,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8872611] [2020-02-10 20:43:39,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:39,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:39,724 INFO L87 Difference]: Start difference. First operand 1571 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:43:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,991 INFO L93 Difference]: Finished difference Result 2946 states and 11707 transitions. [2020-02-10 20:43:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:39,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,999 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:43:39,999 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:43:39,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:43:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 20:43:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7049 transitions. [2020-02-10 20:43:40,065 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7049 transitions. Word has length 28 [2020-02-10 20:43:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,065 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7049 transitions. [2020-02-10 20:43:40,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7049 transitions. [2020-02-10 20:43:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:40,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,068 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1859486064, now seen corresponding path program 210 times [2020-02-10 20:43:40,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807949375] [2020-02-10 20:43:40,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:40,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807949375] [2020-02-10 20:43:40,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:40,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:40,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745593149] [2020-02-10 20:43:40,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:40,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:40,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:40,579 INFO L87 Difference]: Start difference. First operand 1575 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:43:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,850 INFO L93 Difference]: Finished difference Result 2942 states and 11695 transitions. [2020-02-10 20:43:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:40,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,857 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:43:40,857 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:43:40,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:43:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1567. [2020-02-10 20:43:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:43:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7031 transitions. [2020-02-10 20:43:40,923 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7031 transitions. Word has length 28 [2020-02-10 20:43:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,924 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7031 transitions. [2020-02-10 20:43:40,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7031 transitions. [2020-02-10 20:43:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:40,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,926 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1598033708, now seen corresponding path program 211 times [2020-02-10 20:43:40,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147282096] [2020-02-10 20:43:40,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147282096] [2020-02-10 20:43:41,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:41,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083200083] [2020-02-10 20:43:41,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:41,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:41,493 INFO L87 Difference]: Start difference. First operand 1567 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:43:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:41,674 INFO L93 Difference]: Finished difference Result 2973 states and 11768 transitions. [2020-02-10 20:43:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:41,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:41,682 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:43:41,682 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:43:41,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:43:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1583. [2020-02-10 20:43:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:43:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7068 transitions. [2020-02-10 20:43:41,749 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7068 transitions. Word has length 28 [2020-02-10 20:43:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:41,749 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7068 transitions. [2020-02-10 20:43:41,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7068 transitions. [2020-02-10 20:43:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:41,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:41,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] [2020-02-10 20:43:41,752 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -853331210, now seen corresponding path program 212 times [2020-02-10 20:43:41,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:41,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047735092] [2020-02-10 20:43:41,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:42,288 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:43:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:42,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047735092] [2020-02-10 20:43:42,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:42,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:42,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736969534] [2020-02-10 20:43:42,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:42,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:42,296 INFO L87 Difference]: Start difference. First operand 1583 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:43:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,557 INFO L93 Difference]: Finished difference Result 2971 states and 11756 transitions. [2020-02-10 20:43:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:42,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,565 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:43:42,565 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:43:42,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:43:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 20:43:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 20:43:42,632 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 20:43:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,632 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 20:43:42,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 20:43:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:42,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:42,635 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1060178130, now seen corresponding path program 213 times [2020-02-10 20:43:42,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292066598] [2020-02-10 20:43:42,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,179 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:43:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292066598] [2020-02-10 20:43:43,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:43,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47083277] [2020-02-10 20:43:43,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:43,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:43,187 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:43:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,412 INFO L93 Difference]: Finished difference Result 2964 states and 11741 transitions. [2020-02-10 20:43:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:43,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,420 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:43:43,420 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:43:43,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:43:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 20:43:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:43:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7053 transitions. [2020-02-10 20:43:43,489 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7053 transitions. Word has length 28 [2020-02-10 20:43:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:43,489 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7053 transitions. [2020-02-10 20:43:43,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7053 transitions. [2020-02-10 20:43:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:43,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:43,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:43,492 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1918631862, now seen corresponding path program 214 times [2020-02-10 20:43:43,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:43,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310708423] [2020-02-10 20:43:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310708423] [2020-02-10 20:43:44,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:44,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897598853] [2020-02-10 20:43:44,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:44,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:44,011 INFO L87 Difference]: Start difference. First operand 1578 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:43:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:44,217 INFO L93 Difference]: Finished difference Result 2958 states and 11725 transitions. [2020-02-10 20:43:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:44,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:44,225 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:43:44,226 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:43:44,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:43:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1573. [2020-02-10 20:43:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:43:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 20:43:44,292 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 20:43:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:44,292 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 20:43:44,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 20:43:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:44,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:44,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:44,295 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1295465326, now seen corresponding path program 215 times [2020-02-10 20:43:44,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:44,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861762101] [2020-02-10 20:43:44,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861762101] [2020-02-10 20:43:44,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:44,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910187898] [2020-02-10 20:43:44,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:44,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:44,820 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:43:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:45,095 INFO L93 Difference]: Finished difference Result 2959 states and 11728 transitions. [2020-02-10 20:43:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:45,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:45,102 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:43:45,102 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:43:45,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:43:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1577. [2020-02-10 20:43:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:43:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 20:43:45,168 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 20:43:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:45,169 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 20:43:45,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 20:43:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:45,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:45,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:45,171 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:45,171 INFO L82 PathProgramCache]: Analyzing trace with hash -765394476, now seen corresponding path program 216 times [2020-02-10 20:43:45,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:45,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034671434] [2020-02-10 20:43:45,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:45,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034671434] [2020-02-10 20:43:45,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:45,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:45,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805626181] [2020-02-10 20:43:45,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:45,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:45,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:45,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:45,707 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:43:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:45,991 INFO L93 Difference]: Finished difference Result 2955 states and 11716 transitions. [2020-02-10 20:43:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:45,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:45,999 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:43:45,999 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:43:46,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:43:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1561. [2020-02-10 20:43:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:43:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7014 transitions. [2020-02-10 20:43:46,067 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7014 transitions. Word has length 28 [2020-02-10 20:43:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:46,067 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7014 transitions. [2020-02-10 20:43:46,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7014 transitions. [2020-02-10 20:43:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:46,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:46,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] [2020-02-10 20:43:46,070 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 68637930, now seen corresponding path program 217 times [2020-02-10 20:43:46,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:46,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417243837] [2020-02-10 20:43:46,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:46,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417243837] [2020-02-10 20:43:46,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:46,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:46,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512886195] [2020-02-10 20:43:46,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:46,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:46,611 INFO L87 Difference]: Start difference. First operand 1561 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:43:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:46,802 INFO L93 Difference]: Finished difference Result 2976 states and 11795 transitions. [2020-02-10 20:43:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:46,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:46,810 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:43:46,811 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:43:46,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:43:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1582. [2020-02-10 20:43:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:43:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7081 transitions. [2020-02-10 20:43:46,880 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7081 transitions. Word has length 28 [2020-02-10 20:43:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:46,880 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7081 transitions. [2020-02-10 20:43:46,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7081 transitions. [2020-02-10 20:43:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:46,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:46,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:46,883 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash 813340428, now seen corresponding path program 218 times [2020-02-10 20:43:46,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:46,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638656106] [2020-02-10 20:43:46,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:47,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638656106] [2020-02-10 20:43:47,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55120649] [2020-02-10 20:43:47,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:47,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:47,438 INFO L87 Difference]: Start difference. First operand 1582 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:43:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:47,572 INFO L93 Difference]: Finished difference Result 2980 states and 11796 transitions. [2020-02-10 20:43:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:47,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:47,580 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:43:47,580 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:43:47,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:43:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1575. [2020-02-10 20:43:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 20:43:47,647 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 20:43:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:47,647 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 20:43:47,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 20:43:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:47,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:47,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] [2020-02-10 20:43:47,649 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1679578888, now seen corresponding path program 219 times [2020-02-10 20:43:47,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:47,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580909240] [2020-02-10 20:43:47,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:48,168 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:48,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580909240] [2020-02-10 20:43:48,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:48,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:48,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851322827] [2020-02-10 20:43:48,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:48,176 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:43:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:48,346 INFO L93 Difference]: Finished difference Result 2973 states and 11783 transitions. [2020-02-10 20:43:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:48,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:48,354 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:43:48,354 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:43:48,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:43:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1581. [2020-02-10 20:43:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:43:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7072 transitions. [2020-02-10 20:43:48,444 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7072 transitions. Word has length 28 [2020-02-10 20:43:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:48,445 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7072 transitions. [2020-02-10 20:43:48,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7072 transitions. [2020-02-10 20:43:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:48,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:48,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:48,447 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1125983412, now seen corresponding path program 220 times [2020-02-10 20:43:48,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:48,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200212087] [2020-02-10 20:43:48,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:48,967 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:48,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200212087] [2020-02-10 20:43:48,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:48,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:48,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872544345] [2020-02-10 20:43:48,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:48,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:48,975 INFO L87 Difference]: Start difference. First operand 1581 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:43:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:49,151 INFO L93 Difference]: Finished difference Result 2975 states and 11781 transitions. [2020-02-10 20:43:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:49,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:49,159 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:43:49,159 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:43:49,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:43:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1575. [2020-02-10 20:43:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7055 transitions. [2020-02-10 20:43:49,226 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7055 transitions. Word has length 28 [2020-02-10 20:43:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:49,226 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7055 transitions. [2020-02-10 20:43:49,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7055 transitions. [2020-02-10 20:43:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:49,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43: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] [2020-02-10 20:43:49,229 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash -259744952, now seen corresponding path program 221 times [2020-02-10 20:43:49,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:49,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105686256] [2020-02-10 20:43:49,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:49,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105686256] [2020-02-10 20:43:49,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:49,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:49,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797895402] [2020-02-10 20:43:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:49,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:49,776 INFO L87 Difference]: Start difference. First operand 1575 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:43:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:49,908 INFO L93 Difference]: Finished difference Result 2985 states and 11800 transitions. [2020-02-10 20:43:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:49,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:49,916 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:43:49,916 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:43:49,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:43:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1585. [2020-02-10 20:43:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:43:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 20:43:49,983 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 20:43:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:49,983 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 20:43:49,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 20:43:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:49,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:49,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:49,986 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 484957546, now seen corresponding path program 222 times [2020-02-10 20:43:49,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:49,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819679972] [2020-02-10 20:43:49,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:50,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819679972] [2020-02-10 20:43:50,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:50,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:50,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855018340] [2020-02-10 20:43:50,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:50,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:50,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:50,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:50,528 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:43:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:50,703 INFO L93 Difference]: Finished difference Result 2983 states and 11788 transitions. [2020-02-10 20:43:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:50,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:50,711 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:43:50,711 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:43:50,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:43:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1567. [2020-02-10 20:43:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:43:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7034 transitions. [2020-02-10 20:43:50,778 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7034 transitions. Word has length 28 [2020-02-10 20:43:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:50,778 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7034 transitions. [2020-02-10 20:43:50,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7034 transitions. [2020-02-10 20:43:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:50,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:50,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:50,780 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash -437708336, now seen corresponding path program 223 times [2020-02-10 20:43:50,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:50,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879695709] [2020-02-10 20:43:50,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:51,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879695709] [2020-02-10 20:43:51,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:51,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:51,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572266602] [2020-02-10 20:43:51,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:51,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:51,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:51,320 INFO L87 Difference]: Start difference. First operand 1567 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:43:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:51,519 INFO L93 Difference]: Finished difference Result 2962 states and 11752 transitions. [2020-02-10 20:43:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:51,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:51,527 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:43:51,527 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:43:51,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:43:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1579. [2020-02-10 20:43:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:43:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7065 transitions. [2020-02-10 20:43:51,598 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7065 transitions. Word has length 28 [2020-02-10 20:43:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:51,599 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7065 transitions. [2020-02-10 20:43:51,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7065 transitions. [2020-02-10 20:43:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:51,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:51,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] [2020-02-10 20:43:51,602 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 306994162, now seen corresponding path program 224 times [2020-02-10 20:43:51,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:51,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314188700] [2020-02-10 20:43:51,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:52,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314188700] [2020-02-10 20:43:52,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:52,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:52,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581610085] [2020-02-10 20:43:52,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:52,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:52,153 INFO L87 Difference]: Start difference. First operand 1579 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:43:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:52,293 INFO L93 Difference]: Finished difference Result 2966 states and 11753 transitions. [2020-02-10 20:43:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:52,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:52,300 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:43:52,301 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:43:52,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:43:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1572. [2020-02-10 20:43:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:43:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7047 transitions. [2020-02-10 20:43:52,367 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7047 transitions. Word has length 28 [2020-02-10 20:43:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:52,367 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7047 transitions. [2020-02-10 20:43:52,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7047 transitions. [2020-02-10 20:43:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:52,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:52,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] [2020-02-10 20:43:52,369 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1711088200, now seen corresponding path program 225 times [2020-02-10 20:43:52,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:52,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422145337] [2020-02-10 20:43:52,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:52,886 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:43:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:52,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422145337] [2020-02-10 20:43:52,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:52,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:52,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16424880] [2020-02-10 20:43:52,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:52,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:52,894 INFO L87 Difference]: Start difference. First operand 1572 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:43:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:53,088 INFO L93 Difference]: Finished difference Result 2953 states and 11728 transitions. [2020-02-10 20:43:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:53,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:53,096 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:43:53,096 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:43:53,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:43:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1576. [2020-02-10 20:43:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:43:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:43:53,163 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:43:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:53,163 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:43:53,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:43:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:53,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:53,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:53,166 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1139633394, now seen corresponding path program 226 times [2020-02-10 20:43:53,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:53,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042814753] [2020-02-10 20:43:53,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:53,627 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:43:53,779 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:43:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:53,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042814753] [2020-02-10 20:43:53,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:53,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:53,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151833407] [2020-02-10 20:43:53,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:53,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:53,790 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:43:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:53,981 INFO L93 Difference]: Finished difference Result 2951 states and 11720 transitions. [2020-02-10 20:43:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:53,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:53,988 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:43:53,988 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:43:53,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:43:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:43:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:43:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7043 transitions. [2020-02-10 20:43:54,054 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7043 transitions. Word has length 28 [2020-02-10 20:43:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:54,054 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7043 transitions. [2020-02-10 20:43:54,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7043 transitions. [2020-02-10 20:43:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:54,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:54,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:54,057 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash -228235640, now seen corresponding path program 227 times [2020-02-10 20:43:54,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:54,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223590288] [2020-02-10 20:43:54,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:54,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223590288] [2020-02-10 20:43:54,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:54,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:54,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971967837] [2020-02-10 20:43:54,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:54,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:54,590 INFO L87 Difference]: Start difference. First operand 1572 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:43:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:54,750 INFO L93 Difference]: Finished difference Result 2962 states and 11740 transitions. [2020-02-10 20:43:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:54,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:54,757 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:43:54,757 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:43:54,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:43:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1577. [2020-02-10 20:43:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:43:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7051 transitions. [2020-02-10 20:43:54,823 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7051 transitions. Word has length 28 [2020-02-10 20:43:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:54,823 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7051 transitions. [2020-02-10 20:43:54,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7051 transitions. [2020-02-10 20:43:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:54,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:54,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:54,826 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1544392944, now seen corresponding path program 228 times [2020-02-10 20:43:54,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:54,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089688222] [2020-02-10 20:43:54,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:55,346 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:43:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:55,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089688222] [2020-02-10 20:43:55,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:55,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:55,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896611244] [2020-02-10 20:43:55,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:55,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:55,354 INFO L87 Difference]: Start difference. First operand 1577 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:43:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:55,549 INFO L93 Difference]: Finished difference Result 2956 states and 11724 transitions. [2020-02-10 20:43:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:55,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:55,557 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:43:55,557 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:43:55,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:43:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1567. [2020-02-10 20:43:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:43:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:43:55,623 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:43:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:55,623 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:43:55,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:43:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:55,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:55,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:55,626 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:55,626 INFO L82 PathProgramCache]: Analyzing trace with hash -427205232, now seen corresponding path program 229 times [2020-02-10 20:43:55,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:55,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388867864] [2020-02-10 20:43:55,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:56,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388867864] [2020-02-10 20:43:56,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:56,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:56,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651693789] [2020-02-10 20:43:56,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:56,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:56,152 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:43:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:56,336 INFO L93 Difference]: Finished difference Result 2954 states and 11732 transitions. [2020-02-10 20:43:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:56,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:56,343 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:43:56,343 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:43:56,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:43:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:43:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:43:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7055 transitions. [2020-02-10 20:43:56,411 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7055 transitions. Word has length 28 [2020-02-10 20:43:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:56,411 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7055 transitions. [2020-02-10 20:43:56,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7055 transitions. [2020-02-10 20:43:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:56,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:56,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:56,414 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1062199764, now seen corresponding path program 230 times [2020-02-10 20:43:56,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:56,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632762815] [2020-02-10 20:43:56,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:56,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632762815] [2020-02-10 20:43:56,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:56,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:56,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621255901] [2020-02-10 20:43:56,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:56,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:56,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:56,926 INFO L87 Difference]: Start difference. First operand 1577 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:43:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:57,121 INFO L93 Difference]: Finished difference Result 2956 states and 11730 transitions. [2020-02-10 20:43:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:57,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:57,128 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:43:57,128 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:43:57,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:43:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1571. [2020-02-10 20:43:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:43:57,197 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:43:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:57,198 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:43:57,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:43:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:57,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:57,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:57,200 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash 110650346, now seen corresponding path program 231 times [2020-02-10 20:43:57,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:57,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20185424] [2020-02-10 20:43:57,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:57,723 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:43:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:57,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20185424] [2020-02-10 20:43:57,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:57,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:57,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71211015] [2020-02-10 20:43:57,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:57,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:57,731 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:43:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:57,938 INFO L93 Difference]: Finished difference Result 2948 states and 11714 transitions. [2020-02-10 20:43:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:57,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:57,946 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:43:57,946 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:43:57,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:43:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1575. [2020-02-10 20:43:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7047 transitions. [2020-02-10 20:43:58,013 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7047 transitions. Word has length 28 [2020-02-10 20:43:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:58,013 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7047 transitions. [2020-02-10 20:43:58,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7047 transitions. [2020-02-10 20:43:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:58,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:58,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:58,015 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:58,015 INFO L82 PathProgramCache]: Analyzing trace with hash -460804460, now seen corresponding path program 232 times [2020-02-10 20:43:58,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:58,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614050400] [2020-02-10 20:43:58,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:58,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614050400] [2020-02-10 20:43:58,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:58,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:58,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566713845] [2020-02-10 20:43:58,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:58,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:58,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:58,539 INFO L87 Difference]: Start difference. First operand 1575 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:43:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:58,759 INFO L93 Difference]: Finished difference Result 2946 states and 11706 transitions. [2020-02-10 20:43:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:58,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:58,767 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:43:58,767 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:43:58,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:43:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1571. [2020-02-10 20:43:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:43:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:43:58,834 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:43:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:58,834 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:43:58,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:43:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:58,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:58,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] [2020-02-10 20:43:58,837 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash 526969962, now seen corresponding path program 233 times [2020-02-10 20:43:58,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:58,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624600049] [2020-02-10 20:43:58,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:59,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624600049] [2020-02-10 20:43:59,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:59,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:43:59,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026710353] [2020-02-10 20:43:59,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:43:59,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:59,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:43:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:59,383 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:43:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:59,563 INFO L93 Difference]: Finished difference Result 2952 states and 11718 transitions. [2020-02-10 20:43:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:43:59,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:43:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:59,571 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:43:59,571 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:43:59,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:43:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:43:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1575. [2020-02-10 20:43:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:43:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 20:43:59,637 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 20:43:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:59,637 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 20:43:59,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:43:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 20:43:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:43:59,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:59,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:59,639 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:43:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1533889840, now seen corresponding path program 234 times [2020-02-10 20:43:59,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:59,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593254226] [2020-02-10 20:43:59,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:00,164 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:44:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:00,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593254226] [2020-02-10 20:44:00,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:00,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:00,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54356540] [2020-02-10 20:44:00,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:00,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:00,173 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:44:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:00,356 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 20:44:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:00,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:00,364 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:44:00,364 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:44:00,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:44:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1567. [2020-02-10 20:44:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:44:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:44:00,430 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:44:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:00,431 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:44:00,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:44:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:00,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:00,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] [2020-02-10 20:44:00,433 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash 328000370, now seen corresponding path program 235 times [2020-02-10 20:44:00,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:00,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82768707] [2020-02-10 20:44:00,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:00,984 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:00,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82768707] [2020-02-10 20:44:00,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:00,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:00,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851459403] [2020-02-10 20:44:00,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:00,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:00,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:00,992 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:44:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:01,138 INFO L93 Difference]: Finished difference Result 2977 states and 11774 transitions. [2020-02-10 20:44:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:01,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:01,146 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:44:01,146 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:44:01,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:44:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1583. [2020-02-10 20:44:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:44:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7062 transitions. [2020-02-10 20:44:01,215 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7062 transitions. Word has length 28 [2020-02-10 20:44:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:01,215 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7062 transitions. [2020-02-10 20:44:01,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7062 transitions. [2020-02-10 20:44:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:01,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:01,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:01,218 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1072702868, now seen corresponding path program 236 times [2020-02-10 20:44:01,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:01,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577168973] [2020-02-10 20:44:01,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:01,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577168973] [2020-02-10 20:44:01,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:01,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:01,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837630173] [2020-02-10 20:44:01,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:01,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:01,750 INFO L87 Difference]: Start difference. First operand 1583 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:44:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:01,936 INFO L93 Difference]: Finished difference Result 2975 states and 11762 transitions. [2020-02-10 20:44:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:01,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:01,944 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:44:01,944 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:44:01,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:44:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1573. [2020-02-10 20:44:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7039 transitions. [2020-02-10 20:44:02,011 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7039 transitions. Word has length 28 [2020-02-10 20:44:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:02,011 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7039 transitions. [2020-02-10 20:44:02,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7039 transitions. [2020-02-10 20:44:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:02,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:02,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:02,013 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 865855948, now seen corresponding path program 237 times [2020-02-10 20:44:02,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:02,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008633708] [2020-02-10 20:44:02,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:02,557 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:02,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008633708] [2020-02-10 20:44:02,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:02,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:02,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247810966] [2020-02-10 20:44:02,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:02,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:02,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:02,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:02,565 INFO L87 Difference]: Start difference. First operand 1573 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:44:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:02,711 INFO L93 Difference]: Finished difference Result 2968 states and 11747 transitions. [2020-02-10 20:44:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:02,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:02,719 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:44:02,720 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:44:02,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:44:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 20:44:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:44:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7047 transitions. [2020-02-10 20:44:02,786 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7047 transitions. Word has length 28 [2020-02-10 20:44:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:02,786 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7047 transitions. [2020-02-10 20:44:02,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7047 transitions. [2020-02-10 20:44:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:02,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:02,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:02,788 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -450301356, now seen corresponding path program 238 times [2020-02-10 20:44:02,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:02,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284628050] [2020-02-10 20:44:02,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:03,307 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:03,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284628050] [2020-02-10 20:44:03,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:03,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:03,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42301073] [2020-02-10 20:44:03,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:03,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:03,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:03,315 INFO L87 Difference]: Start difference. First operand 1578 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:44:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:03,510 INFO L93 Difference]: Finished difference Result 2962 states and 11731 transitions. [2020-02-10 20:44:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:03,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:03,517 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:44:03,517 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:44:03,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:44:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 20:44:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7034 transitions. [2020-02-10 20:44:03,585 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7034 transitions. Word has length 28 [2020-02-10 20:44:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:03,585 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7034 transitions. [2020-02-10 20:44:03,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7034 transitions. [2020-02-10 20:44:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:03,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:03,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:03,588 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1073467892, now seen corresponding path program 239 times [2020-02-10 20:44:03,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:03,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994528738] [2020-02-10 20:44:03,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:04,119 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:44:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:04,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994528738] [2020-02-10 20:44:04,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:04,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:04,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875793865] [2020-02-10 20:44:04,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:04,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:04,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:04,127 INFO L87 Difference]: Start difference. First operand 1573 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:44:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:04,312 INFO L93 Difference]: Finished difference Result 2963 states and 11734 transitions. [2020-02-10 20:44:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:04,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:04,319 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:44:04,319 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:44:04,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:44:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1577. [2020-02-10 20:44:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:44:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7041 transitions. [2020-02-10 20:44:04,409 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7041 transitions. Word has length 28 [2020-02-10 20:44:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:04,409 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7041 transitions. [2020-02-10 20:44:04,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7041 transitions. [2020-02-10 20:44:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:04,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:04,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:04,412 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1160639602, now seen corresponding path program 240 times [2020-02-10 20:44:04,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:04,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566009809] [2020-02-10 20:44:04,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:04,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566009809] [2020-02-10 20:44:04,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:04,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:04,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631638649] [2020-02-10 20:44:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:04,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:04,947 INFO L87 Difference]: Start difference. First operand 1577 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:44:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:05,132 INFO L93 Difference]: Finished difference Result 2959 states and 11722 transitions. [2020-02-10 20:44:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:05,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:05,139 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:44:05,139 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:44:05,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:44:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1555. [2020-02-10 20:44:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:44:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6997 transitions. [2020-02-10 20:44:05,206 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6997 transitions. Word has length 28 [2020-02-10 20:44:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:05,206 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6997 transitions. [2020-02-10 20:44:05,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6997 transitions. [2020-02-10 20:44:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:05,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:05,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] [2020-02-10 20:44:05,208 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:05,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash 424017834, now seen corresponding path program 241 times [2020-02-10 20:44:05,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:05,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129839701] [2020-02-10 20:44:05,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:05,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129839701] [2020-02-10 20:44:05,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:05,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:05,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388360854] [2020-02-10 20:44:05,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:05,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:05,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:05,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:05,729 INFO L87 Difference]: Start difference. First operand 1555 states and 6997 transitions. Second operand 11 states. [2020-02-10 20:44:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:05,929 INFO L93 Difference]: Finished difference Result 2936 states and 11714 transitions. [2020-02-10 20:44:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:05,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:05,936 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:44:05,936 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:44:05,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:44:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1576. [2020-02-10 20:44:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:44:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7079 transitions. [2020-02-10 20:44:06,005 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7079 transitions. Word has length 28 [2020-02-10 20:44:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:06,005 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7079 transitions. [2020-02-10 20:44:06,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7079 transitions. [2020-02-10 20:44:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:06,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:06,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] [2020-02-10 20:44:06,007 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1168720332, now seen corresponding path program 242 times [2020-02-10 20:44:06,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:06,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195151231] [2020-02-10 20:44:06,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:06,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195151231] [2020-02-10 20:44:06,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:06,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:06,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8393295] [2020-02-10 20:44:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:06,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:06,539 INFO L87 Difference]: Start difference. First operand 1576 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:44:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:06,726 INFO L93 Difference]: Finished difference Result 2937 states and 11711 transitions. [2020-02-10 20:44:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:06,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:06,734 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:44:06,734 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:44:06,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:44:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1571. [2020-02-10 20:44:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:44:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7065 transitions. [2020-02-10 20:44:06,804 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7065 transitions. Word has length 28 [2020-02-10 20:44:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:06,804 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7065 transitions. [2020-02-10 20:44:06,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7065 transitions. [2020-02-10 20:44:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:06,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:06,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] [2020-02-10 20:44:06,806 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2034958792, now seen corresponding path program 243 times [2020-02-10 20:44:06,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:06,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12256942] [2020-02-10 20:44:06,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:07,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12256942] [2020-02-10 20:44:07,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:07,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:07,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182695696] [2020-02-10 20:44:07,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:07,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:07,328 INFO L87 Difference]: Start difference. First operand 1571 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:44:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:07,552 INFO L93 Difference]: Finished difference Result 2941 states and 11718 transitions. [2020-02-10 20:44:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:07,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:07,560 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:44:07,560 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:44:07,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:44:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1577. [2020-02-10 20:44:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:44:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7076 transitions. [2020-02-10 20:44:07,627 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7076 transitions. Word has length 28 [2020-02-10 20:44:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:07,628 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7076 transitions. [2020-02-10 20:44:07,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7076 transitions. [2020-02-10 20:44:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:07,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:07,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:07,630 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash -770603508, now seen corresponding path program 244 times [2020-02-10 20:44:07,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:07,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118433012] [2020-02-10 20:44:07,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:08,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118433012] [2020-02-10 20:44:08,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:08,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:08,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466978252] [2020-02-10 20:44:08,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:08,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:08,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:08,189 INFO L87 Difference]: Start difference. First operand 1577 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:44:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:08,337 INFO L93 Difference]: Finished difference Result 2946 states and 11722 transitions. [2020-02-10 20:44:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:08,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:08,344 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:44:08,345 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:44:08,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:44:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1571. [2020-02-10 20:44:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:44:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7059 transitions. [2020-02-10 20:44:08,415 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7059 transitions. Word has length 28 [2020-02-10 20:44:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:08,415 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7059 transitions. [2020-02-10 20:44:08,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7059 transitions. [2020-02-10 20:44:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:08,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:08,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:08,418 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 95634952, now seen corresponding path program 245 times [2020-02-10 20:44:08,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:08,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089561721] [2020-02-10 20:44:08,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:08,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089561721] [2020-02-10 20:44:08,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:08,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:08,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004049469] [2020-02-10 20:44:08,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:08,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:08,953 INFO L87 Difference]: Start difference. First operand 1571 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:44:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:09,155 INFO L93 Difference]: Finished difference Result 2944 states and 11719 transitions. [2020-02-10 20:44:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:09,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:09,163 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:44:09,163 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:44:09,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:44:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1578. [2020-02-10 20:44:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:44:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 20:44:09,229 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 20:44:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:09,230 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 20:44:09,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 20:44:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:09,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:09,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:09,232 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:09,232 INFO L82 PathProgramCache]: Analyzing trace with hash 840337450, now seen corresponding path program 246 times [2020-02-10 20:44:09,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:09,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415175423] [2020-02-10 20:44:09,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:09,790 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:44:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:09,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415175423] [2020-02-10 20:44:09,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:09,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:09,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10036643] [2020-02-10 20:44:09,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:09,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:09,798 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:44:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:09,958 INFO L93 Difference]: Finished difference Result 2948 states and 11720 transitions. [2020-02-10 20:44:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:09,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:09,966 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:44:09,966 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:44:09,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:44:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1565. [2020-02-10 20:44:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:44:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7043 transitions. [2020-02-10 20:44:10,032 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7043 transitions. Word has length 28 [2020-02-10 20:44:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:10,032 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7043 transitions. [2020-02-10 20:44:10,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7043 transitions. [2020-02-10 20:44:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:10,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:10,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] [2020-02-10 20:44:10,035 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash 216894948, now seen corresponding path program 247 times [2020-02-10 20:44:10,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:10,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463661589] [2020-02-10 20:44:10,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:10,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463661589] [2020-02-10 20:44:10,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:10,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:10,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429905060] [2020-02-10 20:44:10,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:10,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:10,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:10,561 INFO L87 Difference]: Start difference. First operand 1565 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:44:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:10,740 INFO L93 Difference]: Finished difference Result 2923 states and 11678 transitions. [2020-02-10 20:44:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:10,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:10,748 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:44:10,748 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:44:10,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:44:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1574. [2020-02-10 20:44:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:44:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7067 transitions. [2020-02-10 20:44:10,815 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7067 transitions. Word has length 28 [2020-02-10 20:44:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:10,815 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7067 transitions. [2020-02-10 20:44:10,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7067 transitions. [2020-02-10 20:44:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:10,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:10,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:10,819 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 961597446, now seen corresponding path program 248 times [2020-02-10 20:44:10,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:10,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490251957] [2020-02-10 20:44:10,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:11,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490251957] [2020-02-10 20:44:11,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:11,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:11,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964209382] [2020-02-10 20:44:11,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:11,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:11,351 INFO L87 Difference]: Start difference. First operand 1574 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:44:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:11,561 INFO L93 Difference]: Finished difference Result 2924 states and 11675 transitions. [2020-02-10 20:44:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:11,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:11,571 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:44:11,571 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:44:11,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:44:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1569. [2020-02-10 20:44:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:44:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7054 transitions. [2020-02-10 20:44:11,650 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7054 transitions. Word has length 28 [2020-02-10 20:44:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:11,651 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7054 transitions. [2020-02-10 20:44:11,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7054 transitions. [2020-02-10 20:44:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:11,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:11,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] [2020-02-10 20:44:11,654 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash -318334854, now seen corresponding path program 249 times [2020-02-10 20:44:11,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:11,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983345041] [2020-02-10 20:44:11,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:12,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983345041] [2020-02-10 20:44:12,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:12,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:12,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764472215] [2020-02-10 20:44:12,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:12,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:12,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:12,197 INFO L87 Difference]: Start difference. First operand 1569 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:44:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:12,388 INFO L93 Difference]: Finished difference Result 2920 states and 11667 transitions. [2020-02-10 20:44:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:12,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:12,396 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:44:12,397 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:44:12,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:44:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1573. [2020-02-10 20:44:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7061 transitions. [2020-02-10 20:44:12,463 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7061 transitions. Word has length 28 [2020-02-10 20:44:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:12,463 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7061 transitions. [2020-02-10 20:44:12,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7061 transitions. [2020-02-10 20:44:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:12,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:12,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] [2020-02-10 20:44:12,466 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash -145087162, now seen corresponding path program 250 times [2020-02-10 20:44:12,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:12,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002000422] [2020-02-10 20:44:12,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:13,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002000422] [2020-02-10 20:44:13,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:13,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:13,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814032918] [2020-02-10 20:44:13,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:13,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:13,005 INFO L87 Difference]: Start difference. First operand 1573 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:44:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:13,190 INFO L93 Difference]: Finished difference Result 2919 states and 11661 transitions. [2020-02-10 20:44:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:13,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:13,198 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:44:13,198 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:44:13,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:44:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 20:44:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:44:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7050 transitions. [2020-02-10 20:44:13,264 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7050 transitions. Word has length 28 [2020-02-10 20:44:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:13,264 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7050 transitions. [2020-02-10 20:44:13,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7050 transitions. [2020-02-10 20:44:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:13,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:13,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] [2020-02-10 20:44:13,267 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2037308602, now seen corresponding path program 251 times [2020-02-10 20:44:13,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:13,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796649645] [2020-02-10 20:44:13,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:13,809 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:13,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796649645] [2020-02-10 20:44:13,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:13,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:13,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039131439] [2020-02-10 20:44:13,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:13,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:13,817 INFO L87 Difference]: Start difference. First operand 1569 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:44:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:14,086 INFO L93 Difference]: Finished difference Result 2922 states and 11667 transitions. [2020-02-10 20:44:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:14,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:14,093 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:44:14,093 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:44:14,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:44:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1573. [2020-02-10 20:44:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:44:14,159 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:44:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:14,159 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:44:14,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:44:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:14,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:14,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] [2020-02-10 20:44:14,162 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1465853796, now seen corresponding path program 252 times [2020-02-10 20:44:14,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:14,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769416737] [2020-02-10 20:44:14,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:14,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769416737] [2020-02-10 20:44:14,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:14,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:14,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599888304] [2020-02-10 20:44:14,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:14,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:14,695 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:44:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:14,931 INFO L93 Difference]: Finished difference Result 2920 states and 11659 transitions. [2020-02-10 20:44:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:14,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:14,939 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:44:14,939 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:44:14,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:44:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1565. [2020-02-10 20:44:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:44:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7039 transitions. [2020-02-10 20:44:15,007 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7039 transitions. Word has length 28 [2020-02-10 20:44:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:15,007 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7039 transitions. [2020-02-10 20:44:15,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7039 transitions. [2020-02-10 20:44:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:15,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:15,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:15,010 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash 227398052, now seen corresponding path program 253 times [2020-02-10 20:44:15,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:15,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409062423] [2020-02-10 20:44:15,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:15,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409062423] [2020-02-10 20:44:15,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:15,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:15,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776338192] [2020-02-10 20:44:15,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:15,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:15,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:15,573 INFO L87 Difference]: Start difference. First operand 1565 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:44:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:15,837 INFO L93 Difference]: Finished difference Result 2935 states and 11697 transitions. [2020-02-10 20:44:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:15,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:15,844 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:44:15,844 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:44:15,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:44:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1576. [2020-02-10 20:44:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:44:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7068 transitions. [2020-02-10 20:44:15,911 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7068 transitions. Word has length 28 [2020-02-10 20:44:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:15,911 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7068 transitions. [2020-02-10 20:44:15,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7068 transitions. [2020-02-10 20:44:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:15,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:15,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:15,913 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:15,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1716803048, now seen corresponding path program 254 times [2020-02-10 20:44:15,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:15,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377322581] [2020-02-10 20:44:15,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:16,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377322581] [2020-02-10 20:44:16,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:16,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:16,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376604021] [2020-02-10 20:44:16,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:16,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:16,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:16,439 INFO L87 Difference]: Start difference. First operand 1576 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:44:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:16,595 INFO L93 Difference]: Finished difference Result 2940 states and 11701 transitions. [2020-02-10 20:44:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:16,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:16,603 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:44:16,603 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:44:16,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:44:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 20:44:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:44:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:44:16,669 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:44:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:16,669 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:44:16,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:44:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:16,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:16,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] [2020-02-10 20:44:16,672 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1918772708, now seen corresponding path program 255 times [2020-02-10 20:44:16,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:16,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432217394] [2020-02-10 20:44:16,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:17,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432217394] [2020-02-10 20:44:17,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:17,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:17,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721816691] [2020-02-10 20:44:17,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:17,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:17,203 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:44:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:17,438 INFO L93 Difference]: Finished difference Result 2927 states and 11676 transitions. [2020-02-10 20:44:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:17,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:17,446 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:44:17,446 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:44:17,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:44:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1574. [2020-02-10 20:44:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:44:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 20:44:17,512 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 20:44:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:17,512 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 20:44:17,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 20:44:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:17,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:17,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:17,515 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:17,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1745525016, now seen corresponding path program 256 times [2020-02-10 20:44:17,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:17,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086186946] [2020-02-10 20:44:17,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:18,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086186946] [2020-02-10 20:44:18,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:18,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:18,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368895015] [2020-02-10 20:44:18,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:18,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:18,055 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:44:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:18,248 INFO L93 Difference]: Finished difference Result 2926 states and 11670 transitions. [2020-02-10 20:44:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:18,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:18,256 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:44:18,256 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:44:18,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:44:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1570. [2020-02-10 20:44:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:44:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7048 transitions. [2020-02-10 20:44:18,322 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7048 transitions. Word has length 28 [2020-02-10 20:44:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:18,323 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7048 transitions. [2020-02-10 20:44:18,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7048 transitions. [2020-02-10 20:44:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:18,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:18,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:18,325 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1502453092, now seen corresponding path program 257 times [2020-02-10 20:44:18,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:18,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89078555] [2020-02-10 20:44:18,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:18,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89078555] [2020-02-10 20:44:18,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:18,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:18,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173832030] [2020-02-10 20:44:18,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:18,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:18,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:18,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:18,862 INFO L87 Difference]: Start difference. First operand 1570 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:44:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:19,027 INFO L93 Difference]: Finished difference Result 2938 states and 11692 transitions. [2020-02-10 20:44:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:19,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:19,035 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:44:19,035 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:44:19,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:44:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1575. [2020-02-10 20:44:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:44:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7056 transitions. [2020-02-10 20:44:19,103 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7056 transitions. Word has length 28 [2020-02-10 20:44:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:19,103 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7056 transitions. [2020-02-10 20:44:19,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7056 transitions. [2020-02-10 20:44:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:19,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:19,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:19,105 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1476356900, now seen corresponding path program 258 times [2020-02-10 20:44:19,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:19,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605147333] [2020-02-10 20:44:19,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:19,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605147333] [2020-02-10 20:44:19,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:19,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:19,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81080146] [2020-02-10 20:44:19,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:19,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:19,632 INFO L87 Difference]: Start difference. First operand 1575 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:44:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:19,857 INFO L93 Difference]: Finished difference Result 2932 states and 11676 transitions. [2020-02-10 20:44:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:19,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:19,865 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:44:19,865 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:44:19,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:44:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1565. [2020-02-10 20:44:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:44:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7034 transitions. [2020-02-10 20:44:19,931 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7034 transitions. Word has length 28 [2020-02-10 20:44:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:19,931 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7034 transitions. [2020-02-10 20:44:19,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7034 transitions. [2020-02-10 20:44:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:19,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:19,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:19,933 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash 982603654, now seen corresponding path program 259 times [2020-02-10 20:44:19,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:19,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237284439] [2020-02-10 20:44:19,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:20,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237284439] [2020-02-10 20:44:20,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:20,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:20,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551929448] [2020-02-10 20:44:20,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:20,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:20,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:20,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:20,457 INFO L87 Difference]: Start difference. First operand 1565 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:44:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:20,662 INFO L93 Difference]: Finished difference Result 2940 states and 11704 transitions. [2020-02-10 20:44:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:20,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:20,670 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:44:20,670 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:44:20,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:44:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1577. [2020-02-10 20:44:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:44:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7065 transitions. [2020-02-10 20:44:20,736 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7065 transitions. Word has length 28 [2020-02-10 20:44:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:20,736 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7065 transitions. [2020-02-10 20:44:20,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7065 transitions. [2020-02-10 20:44:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:20,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:20,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:20,739 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1727306152, now seen corresponding path program 260 times [2020-02-10 20:44:20,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:20,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701090006] [2020-02-10 20:44:20,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:21,265 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:21,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701090006] [2020-02-10 20:44:21,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:21,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:21,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921371398] [2020-02-10 20:44:21,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:21,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:21,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:21,273 INFO L87 Difference]: Start difference. First operand 1577 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:44:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:21,422 INFO L93 Difference]: Finished difference Result 2944 states and 11705 transitions. [2020-02-10 20:44:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:21,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:21,430 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:44:21,431 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:44:21,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:44:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1570. [2020-02-10 20:44:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:44:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 20:44:21,497 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 20:44:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:21,497 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 20:44:21,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 20:44:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:21,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:21,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:21,499 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1163567106, now seen corresponding path program 261 times [2020-02-10 20:44:21,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:21,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537648225] [2020-02-10 20:44:21,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:22,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537648225] [2020-02-10 20:44:22,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:22,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:22,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264783047] [2020-02-10 20:44:22,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:22,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:22,015 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:44:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:22,197 INFO L93 Difference]: Finished difference Result 2931 states and 11680 transitions. [2020-02-10 20:44:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:22,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:22,204 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:44:22,204 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:44:22,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:44:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1574. [2020-02-10 20:44:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:44:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:44:22,270 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:44:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:22,270 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:44:22,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:44:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:22,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:22,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:22,273 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1735021912, now seen corresponding path program 262 times [2020-02-10 20:44:22,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:22,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149161333] [2020-02-10 20:44:22,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:22,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149161333] [2020-02-10 20:44:22,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:22,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:22,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543130988] [2020-02-10 20:44:22,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:22,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:22,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:22,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:22,790 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:44:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:22,977 INFO L93 Difference]: Finished difference Result 2929 states and 11672 transitions. [2020-02-10 20:44:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:22,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:22,984 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:44:22,984 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:44:22,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:44:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1570. [2020-02-10 20:44:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:44:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 20:44:23,051 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 20:44:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:23,051 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 20:44:23,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 20:44:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:23,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:23,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:23,054 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1192076350, now seen corresponding path program 263 times [2020-02-10 20:44:23,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:23,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145355703] [2020-02-10 20:44:23,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:23,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145355703] [2020-02-10 20:44:23,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:23,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:23,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984798268] [2020-02-10 20:44:23,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:23,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:23,572 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:44:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:23,735 INFO L93 Difference]: Finished difference Result 2940 states and 11692 transitions. [2020-02-10 20:44:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:23,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:23,743 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:44:23,743 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:44:23,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:44:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 20:44:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:44:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 20:44:23,810 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 20:44:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:23,810 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 20:44:23,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 20:44:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:23,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:23,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] [2020-02-10 20:44:23,813 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -124080954, now seen corresponding path program 264 times [2020-02-10 20:44:23,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:23,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176892388] [2020-02-10 20:44:23,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:24,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176892388] [2020-02-10 20:44:24,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:24,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:24,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651675775] [2020-02-10 20:44:24,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:24,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:24,336 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:44:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:24,526 INFO L93 Difference]: Finished difference Result 2934 states and 11676 transitions. [2020-02-10 20:44:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:24,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:24,534 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:44:24,535 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:44:24,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:44:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1560. [2020-02-10 20:44:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:44:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7020 transitions. [2020-02-10 20:44:24,601 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7020 transitions. Word has length 28 [2020-02-10 20:44:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:24,601 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7020 transitions. [2020-02-10 20:44:24,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7020 transitions. [2020-02-10 20:44:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:24,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:24,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:24,604 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash 155271406, now seen corresponding path program 265 times [2020-02-10 20:44:24,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:24,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503061115] [2020-02-10 20:44:24,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:25,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 20:44:25,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503061115] [2020-02-10 20:44:25,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:25,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:25,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879572812] [2020-02-10 20:44:25,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:25,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:25,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:25,136 INFO L87 Difference]: Start difference. First operand 1560 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:44:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:25,320 INFO L93 Difference]: Finished difference Result 2950 states and 11754 transitions. [2020-02-10 20:44:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:25,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:25,327 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:44:25,327 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:44:25,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:44:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1577. [2020-02-10 20:44:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:44:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7079 transitions. [2020-02-10 20:44:25,395 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7079 transitions. Word has length 28 [2020-02-10 20:44:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:25,395 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7079 transitions. [2020-02-10 20:44:25,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7079 transitions. [2020-02-10 20:44:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:25,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:25,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] [2020-02-10 20:44:25,398 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash 899973904, now seen corresponding path program 266 times [2020-02-10 20:44:25,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:25,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438514758] [2020-02-10 20:44:25,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:25,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438514758] [2020-02-10 20:44:25,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:25,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:25,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657376115] [2020-02-10 20:44:25,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:25,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:25,950 INFO L87 Difference]: Start difference. First operand 1577 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:44:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:26,158 INFO L93 Difference]: Finished difference Result 2951 states and 11751 transitions. [2020-02-10 20:44:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:26,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:26,165 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:44:26,165 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:44:26,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:44:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 20:44:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7065 transitions. [2020-02-10 20:44:26,232 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7065 transitions. Word has length 28 [2020-02-10 20:44:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:26,232 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7065 transitions. [2020-02-10 20:44:26,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7065 transitions. [2020-02-10 20:44:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:26,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:26,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:26,235 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:26,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:26,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1766212364, now seen corresponding path program 267 times [2020-02-10 20:44:26,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:26,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837448077] [2020-02-10 20:44:26,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:26,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837448077] [2020-02-10 20:44:26,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:26,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:26,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711069082] [2020-02-10 20:44:26,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:26,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:26,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:26,749 INFO L87 Difference]: Start difference. First operand 1572 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:44:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:26,958 INFO L93 Difference]: Finished difference Result 2955 states and 11758 transitions. [2020-02-10 20:44:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:26,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:26,966 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:44:26,966 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:44:26,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:44:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1578. [2020-02-10 20:44:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:44:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7076 transitions. [2020-02-10 20:44:27,035 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7076 transitions. Word has length 28 [2020-02-10 20:44:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:27,035 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7076 transitions. [2020-02-10 20:44:27,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7076 transitions. [2020-02-10 20:44:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:27,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:27,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:27,038 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1039349936, now seen corresponding path program 268 times [2020-02-10 20:44:27,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:27,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076401587] [2020-02-10 20:44:27,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:27,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076401587] [2020-02-10 20:44:27,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:27,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:27,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005257456] [2020-02-10 20:44:27,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:27,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:27,581 INFO L87 Difference]: Start difference. First operand 1578 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:44:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:27,736 INFO L93 Difference]: Finished difference Result 2960 states and 11762 transitions. [2020-02-10 20:44:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:27,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:27,743 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:44:27,743 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:44:27,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:44:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1572. [2020-02-10 20:44:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7059 transitions. [2020-02-10 20:44:27,815 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7059 transitions. Word has length 28 [2020-02-10 20:44:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:27,815 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7059 transitions. [2020-02-10 20:44:27,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7059 transitions. [2020-02-10 20:44:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:27,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:27,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:27,818 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:27,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash -173111476, now seen corresponding path program 269 times [2020-02-10 20:44:27,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:27,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152993375] [2020-02-10 20:44:27,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:28,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152993375] [2020-02-10 20:44:28,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:28,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:28,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702331080] [2020-02-10 20:44:28,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:28,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:28,342 INFO L87 Difference]: Start difference. First operand 1572 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:44:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:28,533 INFO L93 Difference]: Finished difference Result 2958 states and 11759 transitions. [2020-02-10 20:44:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:28,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:28,541 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:44:28,541 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:44:28,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:44:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1579. [2020-02-10 20:44:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:44:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7072 transitions. [2020-02-10 20:44:28,608 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7072 transitions. Word has length 28 [2020-02-10 20:44:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:28,608 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7072 transitions. [2020-02-10 20:44:28,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7072 transitions. [2020-02-10 20:44:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:28,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:28,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] [2020-02-10 20:44:28,610 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash 571591022, now seen corresponding path program 270 times [2020-02-10 20:44:28,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:28,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756003494] [2020-02-10 20:44:28,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:29,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756003494] [2020-02-10 20:44:29,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:29,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:29,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266761212] [2020-02-10 20:44:29,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:29,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:29,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:29,148 INFO L87 Difference]: Start difference. First operand 1579 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:44:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:29,335 INFO L93 Difference]: Finished difference Result 2962 states and 11760 transitions. [2020-02-10 20:44:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:29,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:29,342 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:44:29,342 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:44:29,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:44:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1566. [2020-02-10 20:44:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:44:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7042 transitions. [2020-02-10 20:44:29,409 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7042 transitions. Word has length 28 [2020-02-10 20:44:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:29,409 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7042 transitions. [2020-02-10 20:44:29,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7042 transitions. [2020-02-10 20:44:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:29,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:29,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:29,411 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -669941720, now seen corresponding path program 271 times [2020-02-10 20:44:29,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:29,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227693579] [2020-02-10 20:44:29,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:29,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227693579] [2020-02-10 20:44:29,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:29,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:29,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665227859] [2020-02-10 20:44:29,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:29,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:29,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:29,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:29,951 INFO L87 Difference]: Start difference. First operand 1566 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:44:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:30,161 INFO L93 Difference]: Finished difference Result 2944 states and 11736 transitions. [2020-02-10 20:44:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:30,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:30,169 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:44:30,169 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:44:30,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:44:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1576. [2020-02-10 20:44:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:44:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7070 transitions. [2020-02-10 20:44:30,237 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7070 transitions. Word has length 28 [2020-02-10 20:44:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:30,237 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7070 transitions. [2020-02-10 20:44:30,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7070 transitions. [2020-02-10 20:44:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:30,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:30,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] [2020-02-10 20:44:30,240 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash 74760778, now seen corresponding path program 272 times [2020-02-10 20:44:30,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:30,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949270104] [2020-02-10 20:44:30,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:30,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949270104] [2020-02-10 20:44:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:30,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:30,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026383926] [2020-02-10 20:44:30,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:30,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:30,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:30,777 INFO L87 Difference]: Start difference. First operand 1576 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:44:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:30,982 INFO L93 Difference]: Finished difference Result 2945 states and 11733 transitions. [2020-02-10 20:44:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:30,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:30,990 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:44:30,990 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:44:30,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:44:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 20:44:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:44:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7056 transitions. [2020-02-10 20:44:31,057 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7056 transitions. Word has length 28 [2020-02-10 20:44:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:31,057 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7056 transitions. [2020-02-10 20:44:31,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7056 transitions. [2020-02-10 20:44:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:31,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:31,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] [2020-02-10 20:44:31,059 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2016710394, now seen corresponding path program 273 times [2020-02-10 20:44:31,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:31,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244000336] [2020-02-10 20:44:31,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:31,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244000336] [2020-02-10 20:44:31,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:31,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:31,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836020228] [2020-02-10 20:44:31,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:31,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:31,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:31,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:31,601 INFO L87 Difference]: Start difference. First operand 1571 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:44:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:31,831 INFO L93 Difference]: Finished difference Result 2945 states and 11733 transitions. [2020-02-10 20:44:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:31,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:31,838 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:44:31,839 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:44:31,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:44:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:44:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:44:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7065 transitions. [2020-02-10 20:44:31,904 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7065 transitions. Word has length 28 [2020-02-10 20:44:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:31,905 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7065 transitions. [2020-02-10 20:44:31,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7065 transitions. [2020-02-10 20:44:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:31,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:31,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] [2020-02-10 20:44:31,907 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash -615604214, now seen corresponding path program 274 times [2020-02-10 20:44:31,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:31,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385155115] [2020-02-10 20:44:31,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:32,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385155115] [2020-02-10 20:44:32,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:32,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:32,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362994322] [2020-02-10 20:44:32,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:32,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:32,438 INFO L87 Difference]: Start difference. First operand 1576 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:44:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:32,629 INFO L93 Difference]: Finished difference Result 2947 states and 11732 transitions. [2020-02-10 20:44:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:32,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:32,636 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:44:32,636 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:44:32,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:44:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:44:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:44:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7051 transitions. [2020-02-10 20:44:32,705 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7051 transitions. Word has length 28 [2020-02-10 20:44:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:32,705 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7051 transitions. [2020-02-10 20:44:32,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7051 transitions. [2020-02-10 20:44:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:32,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:32,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:32,707 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 77386554, now seen corresponding path program 275 times [2020-02-10 20:44:32,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:32,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582414582] [2020-02-10 20:44:32,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:33,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582414582] [2020-02-10 20:44:33,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:33,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:33,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734714479] [2020-02-10 20:44:33,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:33,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:33,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:33,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:33,255 INFO L87 Difference]: Start difference. First operand 1571 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:44:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:33,476 INFO L93 Difference]: Finished difference Result 2948 states and 11735 transitions. [2020-02-10 20:44:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:33,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:33,483 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:44:33,483 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:44:33,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:44:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1577. [2020-02-10 20:44:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:44:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:44:33,549 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:44:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:33,550 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:44:33,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:44:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:33,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:33,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:33,552 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 995336744, now seen corresponding path program 276 times [2020-02-10 20:44:33,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:33,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889440719] [2020-02-10 20:44:33,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:34,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889440719] [2020-02-10 20:44:34,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:34,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:34,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117299628] [2020-02-10 20:44:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:34,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:34,088 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:44:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:34,329 INFO L93 Difference]: Finished difference Result 2949 states and 11731 transitions. [2020-02-10 20:44:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:34,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:34,337 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:44:34,337 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:44:34,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:44:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1566. [2020-02-10 20:44:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:44:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7037 transitions. [2020-02-10 20:44:34,404 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7037 transitions. Word has length 28 [2020-02-10 20:44:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:34,404 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7037 transitions. [2020-02-10 20:44:34,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7037 transitions. [2020-02-10 20:44:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:34,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:34,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] [2020-02-10 20:44:34,406 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash -659438616, now seen corresponding path program 277 times [2020-02-10 20:44:34,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:34,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377424213] [2020-02-10 20:44:34,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:34,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377424213] [2020-02-10 20:44:34,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:34,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:34,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072233335] [2020-02-10 20:44:34,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:34,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:34,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:34,939 INFO L87 Difference]: Start difference. First operand 1566 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:44:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:35,146 INFO L93 Difference]: Finished difference Result 2957 states and 11757 transitions. [2020-02-10 20:44:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:35,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:35,154 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:44:35,154 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:44:35,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:44:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1578. [2020-02-10 20:44:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:44:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7070 transitions. [2020-02-10 20:44:35,222 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7070 transitions. Word has length 28 [2020-02-10 20:44:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:35,222 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7070 transitions. [2020-02-10 20:44:35,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7070 transitions. [2020-02-10 20:44:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:35,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:35,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] [2020-02-10 20:44:35,225 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 829966380, now seen corresponding path program 278 times [2020-02-10 20:44:35,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:35,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211883440] [2020-02-10 20:44:35,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:35,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211883440] [2020-02-10 20:44:35,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:35,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:35,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155513661] [2020-02-10 20:44:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:35,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:35,754 INFO L87 Difference]: Start difference. First operand 1578 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:44:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:35,960 INFO L93 Difference]: Finished difference Result 2962 states and 11761 transitions. [2020-02-10 20:44:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:35,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:35,968 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:44:35,968 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:44:35,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:44:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1572. [2020-02-10 20:44:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7053 transitions. [2020-02-10 20:44:36,037 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7053 transitions. Word has length 28 [2020-02-10 20:44:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:36,037 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7053 transitions. [2020-02-10 20:44:36,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7053 transitions. [2020-02-10 20:44:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:36,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:36,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] [2020-02-10 20:44:36,040 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash 416272540, now seen corresponding path program 279 times [2020-02-10 20:44:36,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:36,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914621791] [2020-02-10 20:44:36,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:36,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914621791] [2020-02-10 20:44:36,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:36,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:36,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984056583] [2020-02-10 20:44:36,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:36,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:36,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:36,571 INFO L87 Difference]: Start difference. First operand 1572 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:44:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:36,761 INFO L93 Difference]: Finished difference Result 2953 states and 11744 transitions. [2020-02-10 20:44:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:36,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:36,770 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:44:36,770 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:44:36,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:44:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:44:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:44:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:44:36,862 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:44:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:36,863 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:44:36,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:44:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:36,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:36,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] [2020-02-10 20:44:36,866 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2078925228, now seen corresponding path program 280 times [2020-02-10 20:44:36,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:36,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402328179] [2020-02-10 20:44:36,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:37,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402328179] [2020-02-10 20:44:37,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:37,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:37,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883259554] [2020-02-10 20:44:37,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:37,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:37,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:37,398 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:44:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:37,624 INFO L93 Difference]: Finished difference Result 2955 states and 11743 transitions. [2020-02-10 20:44:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:37,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:37,632 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:44:37,633 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:44:37,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:44:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:44:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 20:44:37,700 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 20:44:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:37,701 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 20:44:37,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 20:44:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:37,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:37,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] [2020-02-10 20:44:37,703 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 832592156, now seen corresponding path program 281 times [2020-02-10 20:44:37,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:37,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145487437] [2020-02-10 20:44:37,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:38,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145487437] [2020-02-10 20:44:38,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:38,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:38,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219845482] [2020-02-10 20:44:38,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:38,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:38,233 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:44:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:38,429 INFO L93 Difference]: Finished difference Result 2966 states and 11765 transitions. [2020-02-10 20:44:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:38,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:38,437 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:44:38,437 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:44:38,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:44:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1580. [2020-02-10 20:44:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:44:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 20:44:38,504 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 20:44:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:38,504 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 20:44:38,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 20:44:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:38,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:38,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:38,507 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:38,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1005839848, now seen corresponding path program 282 times [2020-02-10 20:44:38,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:38,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806218147] [2020-02-10 20:44:38,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:39,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806218147] [2020-02-10 20:44:39,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:39,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:39,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954177030] [2020-02-10 20:44:39,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:39,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:39,032 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:44:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:39,208 INFO L93 Difference]: Finished difference Result 2963 states and 11752 transitions. [2020-02-10 20:44:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:39,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:39,216 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:44:39,216 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:44:39,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:44:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1566. [2020-02-10 20:44:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:44:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7031 transitions. [2020-02-10 20:44:39,286 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7031 transitions. Word has length 28 [2020-02-10 20:44:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:39,286 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7031 transitions. [2020-02-10 20:44:39,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7031 transitions. [2020-02-10 20:44:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:39,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:39,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:39,288 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash 95766986, now seen corresponding path program 283 times [2020-02-10 20:44:39,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:39,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824211809] [2020-02-10 20:44:39,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44: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 20:44:39,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824211809] [2020-02-10 20:44:39,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:39,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:39,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056121816] [2020-02-10 20:44:39,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:39,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:39,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:39,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:39,817 INFO L87 Difference]: Start difference. First operand 1566 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:44:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:40,022 INFO L93 Difference]: Finished difference Result 2964 states and 11770 transitions. [2020-02-10 20:44:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:40,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:40,029 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:44:40,030 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:44:40,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:44:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 20:44:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:44:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7070 transitions. [2020-02-10 20:44:40,097 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7070 transitions. Word has length 28 [2020-02-10 20:44:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:40,097 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7070 transitions. [2020-02-10 20:44:40,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7070 transitions. [2020-02-10 20:44:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:40,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:40,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:40,100 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash 840469484, now seen corresponding path program 284 times [2020-02-10 20:44:40,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:40,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290146883] [2020-02-10 20:44:40,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:40,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290146883] [2020-02-10 20:44:40,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:40,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:40,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069398562] [2020-02-10 20:44:40,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:40,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:40,635 INFO L87 Difference]: Start difference. First operand 1580 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:44:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:40,829 INFO L93 Difference]: Finished difference Result 2968 states and 11771 transitions. [2020-02-10 20:44:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:40,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:40,837 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:44:40,837 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:44:40,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:44:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1573. [2020-02-10 20:44:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7050 transitions. [2020-02-10 20:44:40,904 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7050 transitions. Word has length 28 [2020-02-10 20:44:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:40,904 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7050 transitions. [2020-02-10 20:44:40,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7050 transitions. [2020-02-10 20:44:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:40,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:40,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] [2020-02-10 20:44:40,906 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1171478142, now seen corresponding path program 285 times [2020-02-10 20:44:40,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:40,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933449699] [2020-02-10 20:44:40,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:41,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933449699] [2020-02-10 20:44:41,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:41,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:41,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901447799] [2020-02-10 20:44:41,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:41,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:41,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:41,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:41,436 INFO L87 Difference]: Start difference. First operand 1573 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:44:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:41,646 INFO L93 Difference]: Finished difference Result 2960 states and 11756 transitions. [2020-02-10 20:44:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:41,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:41,653 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:44:41,653 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:44:41,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:44:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1579. [2020-02-10 20:44:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:44:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7061 transitions. [2020-02-10 20:44:41,723 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7061 transitions. Word has length 28 [2020-02-10 20:44:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:41,723 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7061 transitions. [2020-02-10 20:44:41,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7061 transitions. [2020-02-10 20:44:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:41,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:41,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] [2020-02-10 20:44:41,726 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2089428332, now seen corresponding path program 286 times [2020-02-10 20:44:41,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:41,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512710632] [2020-02-10 20:44:41,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:42,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512710632] [2020-02-10 20:44:42,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:42,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:42,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894362995] [2020-02-10 20:44:42,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:42,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:42,278 INFO L87 Difference]: Start difference. First operand 1579 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:44:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:42,505 INFO L93 Difference]: Finished difference Result 2961 states and 11752 transitions. [2020-02-10 20:44:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:42,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:42,513 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:44:42,513 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:44:42,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:44:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1573. [2020-02-10 20:44:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:44:42,581 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:44:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:42,581 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:44:42,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:44:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:42,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:42,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:42,585 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -767845698, now seen corresponding path program 287 times [2020-02-10 20:44:42,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:42,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449887633] [2020-02-10 20:44:42,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:43,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449887633] [2020-02-10 20:44:43,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:43,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:43,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400602923] [2020-02-10 20:44:43,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:43,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:43,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:43,131 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:44:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:43,276 INFO L93 Difference]: Finished difference Result 2970 states and 11769 transitions. [2020-02-10 20:44:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:43,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:43,284 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:44:43,284 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:44:43,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:44:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1581. [2020-02-10 20:44:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:44:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7058 transitions. [2020-02-10 20:44:43,350 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7058 transitions. Word has length 28 [2020-02-10 20:44:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:43,350 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7058 transitions. [2020-02-10 20:44:43,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7058 transitions. [2020-02-10 20:44:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:43,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:43,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:43,353 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -594598006, now seen corresponding path program 288 times [2020-02-10 20:44:43,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:43,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407074930] [2020-02-10 20:44:43,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:43,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407074930] [2020-02-10 20:44:43,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:43,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:43,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411346672] [2020-02-10 20:44:43,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:43,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:43,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:43,883 INFO L87 Difference]: Start difference. First operand 1581 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:44:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:44,064 INFO L93 Difference]: Finished difference Result 2967 states and 11756 transitions. [2020-02-10 20:44:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:44,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:44,072 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:44:44,072 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:44:44,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:44:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1560. [2020-02-10 20:44:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:44:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7015 transitions. [2020-02-10 20:44:44,138 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7015 transitions. Word has length 28 [2020-02-10 20:44:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:44,138 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7015 transitions. [2020-02-10 20:44:44,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7015 transitions. [2020-02-10 20:44:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:44,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:44,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] [2020-02-10 20:44:44,141 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:44,141 INFO L82 PathProgramCache]: Analyzing trace with hash 405091818, now seen corresponding path program 289 times [2020-02-10 20:44:44,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:44,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582042979] [2020-02-10 20:44:44,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:44,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582042979] [2020-02-10 20:44:44,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:44,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760010910] [2020-02-10 20:44:44,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:44,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:44,679 INFO L87 Difference]: Start difference. First operand 1560 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:44:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:44,894 INFO L93 Difference]: Finished difference Result 2913 states and 11649 transitions. [2020-02-10 20:44:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:44,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:44,902 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:44:44,902 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:44:44,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:44:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1573. [2020-02-10 20:44:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7058 transitions. [2020-02-10 20:44:44,968 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7058 transitions. Word has length 28 [2020-02-10 20:44:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:44,969 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7058 transitions. [2020-02-10 20:44:44,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7058 transitions. [2020-02-10 20:44:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:44,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:44,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:44,971 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1149794316, now seen corresponding path program 290 times [2020-02-10 20:44:44,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:44,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499844333] [2020-02-10 20:44:44,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:45,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499844333] [2020-02-10 20:44:45,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:45,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:45,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642879699] [2020-02-10 20:44:45,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:45,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:45,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:45,502 INFO L87 Difference]: Start difference. First operand 1573 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:44:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:45,707 INFO L93 Difference]: Finished difference Result 2914 states and 11646 transitions. [2020-02-10 20:44:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:45,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:45,715 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:44:45,715 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:44:45,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:44:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1568. [2020-02-10 20:44:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:44:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7045 transitions. [2020-02-10 20:44:45,781 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7045 transitions. Word has length 28 [2020-02-10 20:44:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:45,782 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7045 transitions. [2020-02-10 20:44:45,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7045 transitions. [2020-02-10 20:44:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:45,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:45,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:45,784 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash -130137984, now seen corresponding path program 291 times [2020-02-10 20:44:45,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:45,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657209363] [2020-02-10 20:44:45,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:46,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657209363] [2020-02-10 20:44:46,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:46,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:46,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182771908] [2020-02-10 20:44:46,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:46,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:46,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:46,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:46,320 INFO L87 Difference]: Start difference. First operand 1568 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:44:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:46,548 INFO L93 Difference]: Finished difference Result 2910 states and 11638 transitions. [2020-02-10 20:44:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:46,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:46,557 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:44:46,557 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:44:46,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:44:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1572. [2020-02-10 20:44:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7052 transitions. [2020-02-10 20:44:46,624 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7052 transitions. Word has length 28 [2020-02-10 20:44:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:46,625 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7052 transitions. [2020-02-10 20:44:46,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7052 transitions. [2020-02-10 20:44:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:46,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:46,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] [2020-02-10 20:44:46,627 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:46,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:46,627 INFO L82 PathProgramCache]: Analyzing trace with hash 43109708, now seen corresponding path program 292 times [2020-02-10 20:44:46,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:46,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431427494] [2020-02-10 20:44:46,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:47,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431427494] [2020-02-10 20:44:47,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:47,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:47,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453523438] [2020-02-10 20:44:47,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:47,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:47,167 INFO L87 Difference]: Start difference. First operand 1572 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:44:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:47,379 INFO L93 Difference]: Finished difference Result 2909 states and 11632 transitions. [2020-02-10 20:44:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:47,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:47,386 INFO L225 Difference]: With dead ends: 2909 [2020-02-10 20:44:47,386 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 20:44:47,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 20:44:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1568. [2020-02-10 20:44:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:44:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7041 transitions. [2020-02-10 20:44:47,459 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7041 transitions. Word has length 28 [2020-02-10 20:44:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:47,460 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7041 transitions. [2020-02-10 20:44:47,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7041 transitions. [2020-02-10 20:44:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:47,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:47,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] [2020-02-10 20:44:47,462 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2069461824, now seen corresponding path program 293 times [2020-02-10 20:44:47,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:47,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291036858] [2020-02-10 20:44:47,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:48,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291036858] [2020-02-10 20:44:48,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:48,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:48,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193011115] [2020-02-10 20:44:48,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:48,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:48,015 INFO L87 Difference]: Start difference. First operand 1568 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:44:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:48,279 INFO L93 Difference]: Finished difference Result 2912 states and 11638 transitions. [2020-02-10 20:44:48,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:48,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:48,286 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:44:48,286 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:44:48,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:44:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1572. [2020-02-10 20:44:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 20:44:48,357 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 20:44:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:48,357 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 20:44:48,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 20:44:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:48,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:48,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:48,360 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:48,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1654050666, now seen corresponding path program 294 times [2020-02-10 20:44:48,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:48,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103511135] [2020-02-10 20:44:48,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:48,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103511135] [2020-02-10 20:44:48,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:48,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:48,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307349451] [2020-02-10 20:44:48,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:48,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:48,891 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:44:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:49,121 INFO L93 Difference]: Finished difference Result 2910 states and 11630 transitions. [2020-02-10 20:44:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:49,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:49,129 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:44:49,129 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:44:49,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:44:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1564. [2020-02-10 20:44:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:44:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7030 transitions. [2020-02-10 20:44:49,195 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7030 transitions. Word has length 28 [2020-02-10 20:44:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:49,195 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7030 transitions. [2020-02-10 20:44:49,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7030 transitions. [2020-02-10 20:44:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:49,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:49,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:49,197 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:49,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:49,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1499183406, now seen corresponding path program 295 times [2020-02-10 20:44:49,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:49,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314605314] [2020-02-10 20:44:49,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:49,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314605314] [2020-02-10 20:44:49,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:49,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:49,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888498113] [2020-02-10 20:44:49,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:49,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:49,731 INFO L87 Difference]: Start difference. First operand 1564 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:44:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:49,921 INFO L93 Difference]: Finished difference Result 2920 states and 11664 transitions. [2020-02-10 20:44:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:49,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:49,929 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:44:49,929 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:44:49,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:44:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1574. [2020-02-10 20:44:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:44:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 20:44:49,995 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 20:44:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:49,996 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 20:44:49,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 20:44:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:49,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:49,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:49,998 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2051081392, now seen corresponding path program 296 times [2020-02-10 20:44:49,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:49,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949919483] [2020-02-10 20:44:49,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:50,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949919483] [2020-02-10 20:44:50,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:50,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:50,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006522064] [2020-02-10 20:44:50,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:50,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:50,531 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:44:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:50,734 INFO L93 Difference]: Finished difference Result 2921 states and 11661 transitions. [2020-02-10 20:44:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:50,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:50,741 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:44:50,741 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:44:50,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:44:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1569. [2020-02-10 20:44:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:44:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 20:44:50,807 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 20:44:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:50,808 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 20:44:50,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 20:44:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:50,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:50,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] [2020-02-10 20:44:50,810 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:50,810 INFO L82 PathProgramCache]: Analyzing trace with hash -109131776, now seen corresponding path program 297 times [2020-02-10 20:44:50,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:50,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948215161] [2020-02-10 20:44:50,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:51,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948215161] [2020-02-10 20:44:51,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:51,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:51,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925774172] [2020-02-10 20:44:51,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:51,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:51,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:51,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:51,349 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:44:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:51,619 INFO L93 Difference]: Finished difference Result 2921 states and 11661 transitions. [2020-02-10 20:44:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:51,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:51,626 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:44:51,627 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:44:51,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:44:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1574. [2020-02-10 20:44:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:44:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 20:44:51,693 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 20:44:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:51,693 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 20:44:51,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 20:44:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:51,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:51,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:51,696 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1553520912, now seen corresponding path program 298 times [2020-02-10 20:44:51,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:51,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009587636] [2020-02-10 20:44:51,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:52,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009587636] [2020-02-10 20:44:52,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:52,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:52,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107343477] [2020-02-10 20:44:52,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:52,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:52,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:52,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:52,217 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:44:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:52,485 INFO L93 Difference]: Finished difference Result 2923 states and 11660 transitions. [2020-02-10 20:44:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:52,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:52,493 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:44:52,493 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:44:52,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:44:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 20:44:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:44:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 20:44:52,558 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 20:44:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:52,559 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 20:44:52,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 20:44:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:52,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:52,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:52,561 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:52,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2048455616, now seen corresponding path program 299 times [2020-02-10 20:44:52,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:52,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106183006] [2020-02-10 20:44:52,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:53,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106183006] [2020-02-10 20:44:53,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:53,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:53,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125624797] [2020-02-10 20:44:53,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:53,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:53,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:53,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:53,095 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:44:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:53,355 INFO L93 Difference]: Finished difference Result 2924 states and 11663 transitions. [2020-02-10 20:44:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:53,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:53,363 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:44:53,363 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:44:53,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:44:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1575. [2020-02-10 20:44:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:44:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 20:44:53,452 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 20:44:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:53,452 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 20:44:53,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 20:44:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:53,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:53,455 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:53,455 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1130505426, now seen corresponding path program 300 times [2020-02-10 20:44:53,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:53,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832526751] [2020-02-10 20:44:53,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:54,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832526751] [2020-02-10 20:44:54,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:54,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:54,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307507346] [2020-02-10 20:44:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:54,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:54,003 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:44:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:54,271 INFO L93 Difference]: Finished difference Result 2925 states and 11659 transitions. [2020-02-10 20:44:54,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:54,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:54,279 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:44:54,279 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:44:54,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:44:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1564. [2020-02-10 20:44:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:44:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7026 transitions. [2020-02-10 20:44:54,345 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7026 transitions. Word has length 28 [2020-02-10 20:44:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:54,345 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7026 transitions. [2020-02-10 20:44:54,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7026 transitions. [2020-02-10 20:44:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:54,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:54,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] [2020-02-10 20:44:54,348 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1551698926, now seen corresponding path program 301 times [2020-02-10 20:44:54,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:54,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006454614] [2020-02-10 20:44:54,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:54,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006454614] [2020-02-10 20:44:54,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:54,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:54,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733779006] [2020-02-10 20:44:54,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:54,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:54,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:54,871 INFO L87 Difference]: Start difference. First operand 1564 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:44:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:55,079 INFO L93 Difference]: Finished difference Result 2911 states and 11636 transitions. [2020-02-10 20:44:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:55,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:55,087 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 20:44:55,087 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:44:55,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:44:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1572. [2020-02-10 20:44:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 20:44:55,154 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 20:44:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:55,154 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 20:44:55,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 20:44:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:55,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:55,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:55,156 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1724946618, now seen corresponding path program 302 times [2020-02-10 20:44:55,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:55,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789244734] [2020-02-10 20:44:55,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:55,687 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:55,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789244734] [2020-02-10 20:44:55,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:55,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:55,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122219899] [2020-02-10 20:44:55,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:55,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:55,696 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:44:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:55,910 INFO L93 Difference]: Finished difference Result 2910 states and 11630 transitions. [2020-02-10 20:44:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:55,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:55,917 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:44:55,918 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:44:55,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:44:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1568. [2020-02-10 20:44:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:44:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7037 transitions. [2020-02-10 20:44:55,985 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7037 transitions. Word has length 28 [2020-02-10 20:44:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:55,985 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7037 transitions. [2020-02-10 20:44:55,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7037 transitions. [2020-02-10 20:44:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:55,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:55,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] [2020-02-10 20:44:55,988 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:55,988 INFO L82 PathProgramCache]: Analyzing trace with hash 478613546, now seen corresponding path program 303 times [2020-02-10 20:44:55,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:55,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831367792] [2020-02-10 20:44:55,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:56,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831367792] [2020-02-10 20:44:56,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:56,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:56,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842340999] [2020-02-10 20:44:56,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:56,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:56,510 INFO L87 Difference]: Start difference. First operand 1568 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:44:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:56,712 INFO L93 Difference]: Finished difference Result 2915 states and 11641 transitions. [2020-02-10 20:44:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:56,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:56,720 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 20:44:56,720 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:44:56,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:44:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1573. [2020-02-10 20:44:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:44:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 20:44:56,787 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 20:44:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:56,787 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 20:44:56,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 20:44:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:56,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:56,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] [2020-02-10 20:44:56,790 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2141266234, now seen corresponding path program 304 times [2020-02-10 20:44:56,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:56,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125192918] [2020-02-10 20:44:56,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:57,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125192918] [2020-02-10 20:44:57,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:57,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:57,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373238266] [2020-02-10 20:44:57,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:57,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:57,318 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:44:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:57,487 INFO L93 Difference]: Finished difference Result 2917 states and 11640 transitions. [2020-02-10 20:44:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:57,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:57,494 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:44:57,494 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:44:57,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:44:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1568. [2020-02-10 20:44:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:44:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7033 transitions. [2020-02-10 20:44:57,559 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7033 transitions. Word has length 28 [2020-02-10 20:44:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:57,559 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7033 transitions. [2020-02-10 20:44:57,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7033 transitions. [2020-02-10 20:44:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:57,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:57,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] [2020-02-10 20:44:57,562 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1727572394, now seen corresponding path program 305 times [2020-02-10 20:44:57,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:57,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895182350] [2020-02-10 20:44:57,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:58,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895182350] [2020-02-10 20:44:58,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:58,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:58,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168259940] [2020-02-10 20:44:58,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:58,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:58,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:58,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:58,076 INFO L87 Difference]: Start difference. First operand 1568 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:44:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:58,251 INFO L93 Difference]: Finished difference Result 2912 states and 11630 transitions. [2020-02-10 20:44:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:58,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:58,259 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:44:58,259 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:44:58,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:44:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1572. [2020-02-10 20:44:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7040 transitions. [2020-02-10 20:44:58,325 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7040 transitions. Word has length 28 [2020-02-10 20:44:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:58,325 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7040 transitions. [2020-02-10 20:44:58,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7040 transitions. [2020-02-10 20:44:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:58,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:58,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:58,327 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1077989906, now seen corresponding path program 306 times [2020-02-10 20:44:58,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:58,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614696395] [2020-02-10 20:44:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:58,856 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:44:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:58,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614696395] [2020-02-10 20:44:58,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:58,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:58,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979735393] [2020-02-10 20:44:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:58,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:58,864 INFO L87 Difference]: Start difference. First operand 1572 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:44:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:59,077 INFO L93 Difference]: Finished difference Result 2915 states and 11632 transitions. [2020-02-10 20:44:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:59,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:59,085 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 20:44:59,085 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:44:59,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:44:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1564. [2020-02-10 20:44:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:44:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7022 transitions. [2020-02-10 20:44:59,152 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7022 transitions. Word has length 28 [2020-02-10 20:44:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:59,152 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7022 transitions. [2020-02-10 20:44:59,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7022 transitions. [2020-02-10 20:44:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:59,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:59,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:59,155 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:59,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1988062768, now seen corresponding path program 307 times [2020-02-10 20:44:59,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:59,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872135477] [2020-02-10 20:44:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:59,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872135477] [2020-02-10 20:44:59,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:59,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:44:59,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132415256] [2020-02-10 20:44:59,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:44:59,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:44:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:59,672 INFO L87 Difference]: Start difference. First operand 1564 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:44:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:59,841 INFO L93 Difference]: Finished difference Result 2915 states and 11641 transitions. [2020-02-10 20:44:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:44:59,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:44:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:59,849 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 20:44:59,849 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:44:59,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:44:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:44:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1572. [2020-02-10 20:44:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:44:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7044 transitions. [2020-02-10 20:44:59,915 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7044 transitions. Word has length 28 [2020-02-10 20:44:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:59,915 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7044 transitions. [2020-02-10 20:44:59,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:44:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7044 transitions. [2020-02-10 20:44:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:44:59,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:59,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:59,918 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:44:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1735449722, now seen corresponding path program 308 times [2020-02-10 20:44:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:59,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181441206] [2020-02-10 20:44:59,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:00,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181441206] [2020-02-10 20:45:00,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:00,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:00,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632681248] [2020-02-10 20:45:00,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:00,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:00,436 INFO L87 Difference]: Start difference. First operand 1572 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:45:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:00,622 INFO L93 Difference]: Finished difference Result 2913 states and 11633 transitions. [2020-02-10 20:45:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:00,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:00,630 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:45:00,631 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:45:00,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:45:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1568. [2020-02-10 20:45:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:45:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7033 transitions. [2020-02-10 20:45:00,696 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7033 transitions. Word has length 28 [2020-02-10 20:45:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:00,696 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7033 transitions. [2020-02-10 20:45:00,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7033 transitions. [2020-02-10 20:45:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:00,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:00,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] [2020-02-10 20:45:00,699 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1233819148, now seen corresponding path program 309 times [2020-02-10 20:45:00,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:00,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213022474] [2020-02-10 20:45:00,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:01,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213022474] [2020-02-10 20:45:01,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:01,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:01,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976254371] [2020-02-10 20:45:01,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:01,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:01,229 INFO L87 Difference]: Start difference. First operand 1568 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:45:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:01,398 INFO L93 Difference]: Finished difference Result 2920 states and 11649 transitions. [2020-02-10 20:45:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:01,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:01,405 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:45:01,405 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:45:01,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:45:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 20:45:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7044 transitions. [2020-02-10 20:45:01,471 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7044 transitions. Word has length 28 [2020-02-10 20:45:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:01,471 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7044 transitions. [2020-02-10 20:45:01,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7044 transitions. [2020-02-10 20:45:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:01,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:01,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] [2020-02-10 20:45:01,474 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:01,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2143197958, now seen corresponding path program 310 times [2020-02-10 20:45:01,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:01,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067238121] [2020-02-10 20:45:01,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:01,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067238121] [2020-02-10 20:45:01,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:01,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:01,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309353] [2020-02-10 20:45:01,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:01,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:01,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:01,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:01,997 INFO L87 Difference]: Start difference. First operand 1574 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:45:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:02,203 INFO L93 Difference]: Finished difference Result 2921 states and 11645 transitions. [2020-02-10 20:45:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:02,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:02,211 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:45:02,211 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:45:02,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:45:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1568. [2020-02-10 20:45:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:45:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7029 transitions. [2020-02-10 20:45:02,277 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7029 transitions. Word has length 28 [2020-02-10 20:45:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:02,278 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7029 transitions. [2020-02-10 20:45:02,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7029 transitions. [2020-02-10 20:45:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:02,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:02,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:02,280 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash 127134540, now seen corresponding path program 311 times [2020-02-10 20:45:02,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:02,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816655894] [2020-02-10 20:45:02,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:02,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816655894] [2020-02-10 20:45:02,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:02,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:02,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579579887] [2020-02-10 20:45:02,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:02,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:02,841 INFO L87 Difference]: Start difference. First operand 1568 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:45:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:03,013 INFO L93 Difference]: Finished difference Result 2914 states and 11631 transitions. [2020-02-10 20:45:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:03,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:03,021 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:45:03,022 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:45:03,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:45:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1572. [2020-02-10 20:45:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:45:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7036 transitions. [2020-02-10 20:45:03,088 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7036 transitions. Word has length 28 [2020-02-10 20:45:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:03,088 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7036 transitions. [2020-02-10 20:45:03,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7036 transitions. [2020-02-10 20:45:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:03,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:03,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:03,090 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1616539536, now seen corresponding path program 312 times [2020-02-10 20:45:03,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:03,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457704129] [2020-02-10 20:45:03,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:03,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457704129] [2020-02-10 20:45:03,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:03,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:03,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391065453] [2020-02-10 20:45:03,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:03,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:03,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:03,620 INFO L87 Difference]: Start difference. First operand 1572 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:45:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:03,794 INFO L93 Difference]: Finished difference Result 2917 states and 11633 transitions. [2020-02-10 20:45:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:03,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:03,801 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:45:03,802 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:45:03,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:45:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1560. [2020-02-10 20:45:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:45:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7011 transitions. [2020-02-10 20:45:03,867 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7011 transitions. Word has length 28 [2020-02-10 20:45:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:03,868 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7011 transitions. [2020-02-10 20:45:03,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7011 transitions. [2020-02-10 20:45:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:03,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:03,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] [2020-02-10 20:45:03,870 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1953338296, now seen corresponding path program 313 times [2020-02-10 20:45:03,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:03,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336370273] [2020-02-10 20:45:03,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:04,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336370273] [2020-02-10 20:45:04,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:04,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:04,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591688264] [2020-02-10 20:45:04,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:04,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:04,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:04,388 INFO L87 Difference]: Start difference. First operand 1560 states and 7011 transitions. Second operand 11 states. [2020-02-10 20:45:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:04,571 INFO L93 Difference]: Finished difference Result 2937 states and 11697 transitions. [2020-02-10 20:45:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:04,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:04,578 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:45:04,578 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:45:04,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:45:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1576. [2020-02-10 20:45:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:45:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 20:45:04,645 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 20:45:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:04,646 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 20:45:04,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 20:45:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:04,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:04,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] [2020-02-10 20:45:04,649 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:04,649 INFO L82 PathProgramCache]: Analyzing trace with hash -463933300, now seen corresponding path program 314 times [2020-02-10 20:45:04,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:04,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586334382] [2020-02-10 20:45:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:05,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586334382] [2020-02-10 20:45:05,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:05,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:05,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032898216] [2020-02-10 20:45:05,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:05,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:05,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:05,156 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:45:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:05,302 INFO L93 Difference]: Finished difference Result 2942 states and 11701 transitions. [2020-02-10 20:45:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:05,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:05,310 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:45:05,311 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:45:05,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:45:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1570. [2020-02-10 20:45:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 20:45:05,378 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 20:45:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:05,378 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 20:45:05,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 20:45:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:05,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:05,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:05,380 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash 195458240, now seen corresponding path program 315 times [2020-02-10 20:45:05,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:05,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162041350] [2020-02-10 20:45:05,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:05,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162041350] [2020-02-10 20:45:05,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:05,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:05,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937164232] [2020-02-10 20:45:05,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:05,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:05,898 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:45:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:06,085 INFO L93 Difference]: Finished difference Result 2929 states and 11676 transitions. [2020-02-10 20:45:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:06,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:06,092 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:45:06,092 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:45:06,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:45:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1574. [2020-02-10 20:45:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:45:06,158 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:45:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:06,158 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:45:06,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:45:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:06,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:06,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] [2020-02-10 20:45:06,161 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash 368705932, now seen corresponding path program 316 times [2020-02-10 20:45:06,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:06,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271391600] [2020-02-10 20:45:06,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:06,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271391600] [2020-02-10 20:45:06,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:06,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:06,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205291572] [2020-02-10 20:45:06,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:06,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:06,686 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:45:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:06,865 INFO L93 Difference]: Finished difference Result 2928 states and 11670 transitions. [2020-02-10 20:45:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:06,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:06,873 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:45:06,873 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:45:06,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:45:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1570. [2020-02-10 20:45:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 20:45:06,939 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 20:45:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:06,940 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 20:45:06,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 20:45:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:06,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:06,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] [2020-02-10 20:45:06,942 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:06,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:06,942 INFO L82 PathProgramCache]: Analyzing trace with hash 611777856, now seen corresponding path program 317 times [2020-02-10 20:45:06,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:06,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136953425] [2020-02-10 20:45:06,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:07,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136953425] [2020-02-10 20:45:07,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:07,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:07,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940718089] [2020-02-10 20:45:07,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:07,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:07,468 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:45:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:07,603 INFO L93 Difference]: Finished difference Result 2940 states and 11692 transitions. [2020-02-10 20:45:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:07,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:07,611 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:45:07,611 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:45:07,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:45:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 20:45:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:45:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 20:45:07,678 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 20:45:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:07,678 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 20:45:07,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 20:45:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:07,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:07,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] [2020-02-10 20:45:07,680 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash -704379448, now seen corresponding path program 318 times [2020-02-10 20:45:07,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:07,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274125742] [2020-02-10 20:45:07,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:08,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274125742] [2020-02-10 20:45:08,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:08,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:08,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926290283] [2020-02-10 20:45:08,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:08,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:08,195 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:45:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:08,369 INFO L93 Difference]: Finished difference Result 2934 states and 11676 transitions. [2020-02-10 20:45:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:08,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:08,377 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:45:08,377 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:45:08,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:45:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1565. [2020-02-10 20:45:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:45:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7029 transitions. [2020-02-10 20:45:08,443 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7029 transitions. Word has length 28 [2020-02-10 20:45:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:08,443 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7029 transitions. [2020-02-10 20:45:08,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7029 transitions. [2020-02-10 20:45:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:08,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:08,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] [2020-02-10 20:45:08,446 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash -859246708, now seen corresponding path program 319 times [2020-02-10 20:45:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755384924] [2020-02-10 20:45:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:08,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755384924] [2020-02-10 20:45:08,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:08,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:08,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544699108] [2020-02-10 20:45:08,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:08,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:08,995 INFO L87 Difference]: Start difference. First operand 1565 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:45:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:09,192 INFO L93 Difference]: Finished difference Result 2945 states and 11714 transitions. [2020-02-10 20:45:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:09,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:09,200 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:45:09,200 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:45:09,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:45:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 20:45:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:45:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:45:09,267 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:45:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:09,267 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:45:09,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:45:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:09,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:09,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:09,270 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash 630158288, now seen corresponding path program 320 times [2020-02-10 20:45:09,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:09,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972215622] [2020-02-10 20:45:09,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:09,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972215622] [2020-02-10 20:45:09,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:09,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:09,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567253984] [2020-02-10 20:45:09,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:09,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:09,803 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:45:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:09,982 INFO L93 Difference]: Finished difference Result 2950 states and 11718 transitions. [2020-02-10 20:45:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:09,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:09,990 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:45:09,991 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:45:09,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:45:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 20:45:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7045 transitions. [2020-02-10 20:45:10,057 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7045 transitions. Word has length 28 [2020-02-10 20:45:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:10,057 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7045 transitions. [2020-02-10 20:45:10,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7045 transitions. [2020-02-10 20:45:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:10,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:10,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] [2020-02-10 20:45:10,059 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash 216464448, now seen corresponding path program 321 times [2020-02-10 20:45:10,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:10,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371767126] [2020-02-10 20:45:10,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:10,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371767126] [2020-02-10 20:45:10,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:10,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:10,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687512415] [2020-02-10 20:45:10,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:10,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:10,602 INFO L87 Difference]: Start difference. First operand 1571 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:45:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:10,771 INFO L93 Difference]: Finished difference Result 2941 states and 11701 transitions. [2020-02-10 20:45:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:10,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:10,779 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:45:10,779 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:45:10,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:45:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1576. [2020-02-10 20:45:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:45:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:45:10,845 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:45:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:10,846 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:45:10,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:45:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:10,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:10,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] [2020-02-10 20:45:10,848 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1879117136, now seen corresponding path program 322 times [2020-02-10 20:45:10,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:10,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87241737] [2020-02-10 20:45:10,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:11,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87241737] [2020-02-10 20:45:11,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:11,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:11,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901912791] [2020-02-10 20:45:11,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:11,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:11,359 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:45:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:11,541 INFO L93 Difference]: Finished difference Result 2943 states and 11700 transitions. [2020-02-10 20:45:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:11,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:11,549 INFO L225 Difference]: With dead ends: 2943 [2020-02-10 20:45:11,549 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:45:11,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:45:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 20:45:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:45:11,615 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:45:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:11,615 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:45:11,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:45:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:11,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:11,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:11,618 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash 632784064, now seen corresponding path program 323 times [2020-02-10 20:45:11,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:11,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041666227] [2020-02-10 20:45:11,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:12,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041666227] [2020-02-10 20:45:12,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:12,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:12,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918354338] [2020-02-10 20:45:12,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:12,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:12,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:12,144 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:45:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:12,277 INFO L93 Difference]: Finished difference Result 2954 states and 11722 transitions. [2020-02-10 20:45:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:12,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:12,285 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:45:12,285 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:45:12,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:45:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1579. [2020-02-10 20:45:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:45:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7054 transitions. [2020-02-10 20:45:12,352 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7054 transitions. Word has length 28 [2020-02-10 20:45:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:12,352 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7054 transitions. [2020-02-10 20:45:12,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7054 transitions. [2020-02-10 20:45:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:12,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:12,354 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:12,354 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash 806031756, now seen corresponding path program 324 times [2020-02-10 20:45:12,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:12,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845085859] [2020-02-10 20:45:12,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:12,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845085859] [2020-02-10 20:45:12,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:12,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:12,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702215185] [2020-02-10 20:45:12,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:12,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:12,884 INFO L87 Difference]: Start difference. First operand 1579 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:45:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:13,068 INFO L93 Difference]: Finished difference Result 2951 states and 11709 transitions. [2020-02-10 20:45:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:13,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:13,076 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:45:13,077 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:45:13,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:45:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1565. [2020-02-10 20:45:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:45:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7024 transitions. [2020-02-10 20:45:13,143 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7024 transitions. Word has length 28 [2020-02-10 20:45:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:13,143 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7024 transitions. [2020-02-10 20:45:13,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7024 transitions. [2020-02-10 20:45:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:13,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:13,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:13,146 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -817234292, now seen corresponding path program 325 times [2020-02-10 20:45:13,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:13,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329437685] [2020-02-10 20:45:13,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329437685] [2020-02-10 20:45:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:13,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659067319] [2020-02-10 20:45:13,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:13,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:13,673 INFO L87 Difference]: Start difference. First operand 1565 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:45:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:13,879 INFO L93 Difference]: Finished difference Result 2923 states and 11659 transitions. [2020-02-10 20:45:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:13,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:13,886 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:45:13,886 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:45:13,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:45:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1573. [2020-02-10 20:45:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 20:45:13,962 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 20:45:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:13,962 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 20:45:13,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 20:45:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:13,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:13,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] [2020-02-10 20:45:13,965 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash -643986600, now seen corresponding path program 326 times [2020-02-10 20:45:13,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:13,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888612586] [2020-02-10 20:45:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:14,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 20:45:14,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888612586] [2020-02-10 20:45:14,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:14,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:14,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209200868] [2020-02-10 20:45:14,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:14,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:14,492 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:45:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:14,675 INFO L93 Difference]: Finished difference Result 2922 states and 11653 transitions. [2020-02-10 20:45:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:14,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:14,683 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:45:14,683 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:45:14,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:45:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 20:45:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:45:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7035 transitions. [2020-02-10 20:45:14,749 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7035 transitions. Word has length 28 [2020-02-10 20:45:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:14,749 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7035 transitions. [2020-02-10 20:45:14,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7035 transitions. [2020-02-10 20:45:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:14,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:14,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] [2020-02-10 20:45:14,752 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1890319672, now seen corresponding path program 327 times [2020-02-10 20:45:14,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:14,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033784106] [2020-02-10 20:45:14,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033784106] [2020-02-10 20:45:15,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:15,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:15,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280468041] [2020-02-10 20:45:15,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:15,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:15,268 INFO L87 Difference]: Start difference. First operand 1569 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:45:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:15,462 INFO L93 Difference]: Finished difference Result 2927 states and 11664 transitions. [2020-02-10 20:45:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:15,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:15,470 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:45:15,470 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:45:15,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:45:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1574. [2020-02-10 20:45:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7044 transitions. [2020-02-10 20:45:15,536 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7044 transitions. Word has length 28 [2020-02-10 20:45:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:15,536 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7044 transitions. [2020-02-10 20:45:15,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7044 transitions. [2020-02-10 20:45:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:15,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:15,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] [2020-02-10 20:45:15,538 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:15,539 INFO L82 PathProgramCache]: Analyzing trace with hash -227666984, now seen corresponding path program 328 times [2020-02-10 20:45:15,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:15,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512230661] [2020-02-10 20:45:15,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:16,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512230661] [2020-02-10 20:45:16,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:16,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:16,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479953167] [2020-02-10 20:45:16,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:16,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:16,052 INFO L87 Difference]: Start difference. First operand 1574 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:45:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:16,231 INFO L93 Difference]: Finished difference Result 2929 states and 11663 transitions. [2020-02-10 20:45:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:16,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:16,239 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:45:16,239 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:45:16,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:45:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1569. [2020-02-10 20:45:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:45:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7031 transitions. [2020-02-10 20:45:16,307 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7031 transitions. Word has length 28 [2020-02-10 20:45:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:16,307 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7031 transitions. [2020-02-10 20:45:16,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7031 transitions. [2020-02-10 20:45:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:16,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45: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] [2020-02-10 20:45:16,310 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -641360824, now seen corresponding path program 329 times [2020-02-10 20:45:16,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:16,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070211189] [2020-02-10 20:45:16,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:16,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070211189] [2020-02-10 20:45:16,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:16,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:16,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308109382] [2020-02-10 20:45:16,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:16,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:16,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:16,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:16,820 INFO L87 Difference]: Start difference. First operand 1569 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:45:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:17,000 INFO L93 Difference]: Finished difference Result 2924 states and 11653 transitions. [2020-02-10 20:45:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:17,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:17,008 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:45:17,008 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:45:17,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:45:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1573. [2020-02-10 20:45:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7038 transitions. [2020-02-10 20:45:17,075 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7038 transitions. Word has length 28 [2020-02-10 20:45:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:17,075 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7038 transitions. [2020-02-10 20:45:17,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7038 transitions. [2020-02-10 20:45:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:17,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:17,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:17,078 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 848044172, now seen corresponding path program 330 times [2020-02-10 20:45:17,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:17,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293627726] [2020-02-10 20:45:17,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:17,595 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:45:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:17,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293627726] [2020-02-10 20:45:17,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:17,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:17,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958399113] [2020-02-10 20:45:17,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:17,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:17,603 INFO L87 Difference]: Start difference. First operand 1573 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:45:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:17,783 INFO L93 Difference]: Finished difference Result 2927 states and 11655 transitions. [2020-02-10 20:45:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:17,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:17,790 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:45:17,790 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:45:17,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:45:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1565. [2020-02-10 20:45:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:45:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7020 transitions. [2020-02-10 20:45:17,858 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7020 transitions. Word has length 28 [2020-02-10 20:45:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:17,858 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7020 transitions. [2020-02-10 20:45:17,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7020 transitions. [2020-02-10 20:45:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:17,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:17,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] [2020-02-10 20:45:17,860 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 693176912, now seen corresponding path program 331 times [2020-02-10 20:45:17,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:17,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328141444] [2020-02-10 20:45:17,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:18,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328141444] [2020-02-10 20:45:18,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:18,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:18,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752121975] [2020-02-10 20:45:18,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:18,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:18,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:18,379 INFO L87 Difference]: Start difference. First operand 1565 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:45:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:18,522 INFO L93 Difference]: Finished difference Result 2944 states and 11697 transitions. [2020-02-10 20:45:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:18,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:18,530 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:45:18,530 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:45:18,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:45:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1575. [2020-02-10 20:45:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:45:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 20:45:18,596 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 20:45:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:18,596 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 20:45:18,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 20:45:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:18,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:18,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:18,599 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -622980392, now seen corresponding path program 332 times [2020-02-10 20:45:18,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:18,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855267595] [2020-02-10 20:45:18,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:19,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855267595] [2020-02-10 20:45:19,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:19,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542791500] [2020-02-10 20:45:19,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:19,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:19,113 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:45:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:19,282 INFO L93 Difference]: Finished difference Result 2938 states and 11681 transitions. [2020-02-10 20:45:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:19,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:19,290 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:45:19,290 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:45:19,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:45:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1570. [2020-02-10 20:45:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7033 transitions. [2020-02-10 20:45:19,358 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7033 transitions. Word has length 28 [2020-02-10 20:45:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:19,358 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7033 transitions. [2020-02-10 20:45:19,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7033 transitions. [2020-02-10 20:45:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:19,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:19,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] [2020-02-10 20:45:19,361 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash -379908468, now seen corresponding path program 333 times [2020-02-10 20:45:19,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:19,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118109414] [2020-02-10 20:45:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:19,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118109414] [2020-02-10 20:45:19,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:19,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:19,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930462501] [2020-02-10 20:45:19,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:19,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:19,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:19,894 INFO L87 Difference]: Start difference. First operand 1570 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:45:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:20,039 INFO L93 Difference]: Finished difference Result 2950 states and 11707 transitions. [2020-02-10 20:45:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:20,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:20,047 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:45:20,047 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:45:20,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:45:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1578. [2020-02-10 20:45:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:45:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7047 transitions. [2020-02-10 20:45:20,113 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7047 transitions. Word has length 28 [2020-02-10 20:45:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:20,113 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7047 transitions. [2020-02-10 20:45:20,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7047 transitions. [2020-02-10 20:45:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:20,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:20,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] [2020-02-10 20:45:20,116 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -206660776, now seen corresponding path program 334 times [2020-02-10 20:45:20,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:20,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909706228] [2020-02-10 20:45:20,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:20,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909706228] [2020-02-10 20:45:20,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:20,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:20,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746243240] [2020-02-10 20:45:20,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:20,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:20,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:20,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:20,649 INFO L87 Difference]: Start difference. First operand 1578 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:45:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:20,851 INFO L93 Difference]: Finished difference Result 2947 states and 11694 transitions. [2020-02-10 20:45:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:20,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:20,859 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:45:20,859 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:45:20,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:45:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1570. [2020-02-10 20:45:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 20:45:20,924 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 20:45:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:20,925 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 20:45:20,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 20:45:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:20,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:20,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] [2020-02-10 20:45:20,927 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 452730764, now seen corresponding path program 335 times [2020-02-10 20:45:20,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:20,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975039932] [2020-02-10 20:45:20,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:21,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975039932] [2020-02-10 20:45:21,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:21,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:21,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826931644] [2020-02-10 20:45:21,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:21,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:21,445 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:45:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:21,674 INFO L93 Difference]: Finished difference Result 2934 states and 11669 transitions. [2020-02-10 20:45:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:21,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:21,682 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:45:21,682 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:45:21,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:45:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1574. [2020-02-10 20:45:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7035 transitions. [2020-02-10 20:45:21,748 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7035 transitions. Word has length 28 [2020-02-10 20:45:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:21,748 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7035 transitions. [2020-02-10 20:45:21,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7035 transitions. [2020-02-10 20:45:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:21,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:21,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] [2020-02-10 20:45:21,751 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1942135760, now seen corresponding path program 336 times [2020-02-10 20:45:21,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:21,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303905757] [2020-02-10 20:45:21,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:22,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303905757] [2020-02-10 20:45:22,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:22,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:22,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79237788] [2020-02-10 20:45:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:22,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:22,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:22,273 INFO L87 Difference]: Start difference. First operand 1574 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:45:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:22,473 INFO L93 Difference]: Finished difference Result 2937 states and 11671 transitions. [2020-02-10 20:45:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:22,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:22,480 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:45:22,480 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:45:22,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:45:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1560. [2020-02-10 20:45:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 20:45:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7006 transitions. [2020-02-10 20:45:22,548 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7006 transitions. Word has length 28 [2020-02-10 20:45:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:22,548 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7006 transitions. [2020-02-10 20:45:22,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7006 transitions. [2020-02-10 20:45:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:22,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:22,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:22,550 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:22,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash 727901384, now seen corresponding path program 337 times [2020-02-10 20:45:22,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:22,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120109034] [2020-02-10 20:45:22,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:23,068 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:45:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:23,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120109034] [2020-02-10 20:45:23,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:23,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:23,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661315109] [2020-02-10 20:45:23,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:23,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:23,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:23,076 INFO L87 Difference]: Start difference. First operand 1560 states and 7006 transitions. Second operand 11 states. [2020-02-10 20:45:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:23,285 INFO L93 Difference]: Finished difference Result 2946 states and 11716 transitions. [2020-02-10 20:45:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:23,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:23,293 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:45:23,293 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:45:23,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:45:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 20:45:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:45:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7060 transitions. [2020-02-10 20:45:23,361 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7060 transitions. Word has length 28 [2020-02-10 20:45:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:23,361 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7060 transitions. [2020-02-10 20:45:23,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7060 transitions. [2020-02-10 20:45:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:23,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:23,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] [2020-02-10 20:45:23,364 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1472603882, now seen corresponding path program 338 times [2020-02-10 20:45:23,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:23,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323488381] [2020-02-10 20:45:23,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:23,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323488381] [2020-02-10 20:45:23,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:23,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:23,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796100885] [2020-02-10 20:45:23,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:23,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:23,890 INFO L87 Difference]: Start difference. First operand 1577 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:45:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:24,053 INFO L93 Difference]: Finished difference Result 2950 states and 11717 transitions. [2020-02-10 20:45:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:24,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:24,060 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:45:24,060 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:45:24,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:45:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1570. [2020-02-10 20:45:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7042 transitions. [2020-02-10 20:45:24,128 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7042 transitions. Word has length 28 [2020-02-10 20:45:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:24,129 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7042 transitions. [2020-02-10 20:45:24,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7042 transitions. [2020-02-10 20:45:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:24,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:24,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:24,131 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1418269376, now seen corresponding path program 339 times [2020-02-10 20:45:24,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:24,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183819761] [2020-02-10 20:45:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:24,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183819761] [2020-02-10 20:45:24,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:24,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:24,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794291935] [2020-02-10 20:45:24,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:24,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:24,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:24,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:24,644 INFO L87 Difference]: Start difference. First operand 1570 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:45:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:24,828 INFO L93 Difference]: Finished difference Result 2937 states and 11692 transitions. [2020-02-10 20:45:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:24,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:24,836 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:45:24,836 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:45:24,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:45:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1574. [2020-02-10 20:45:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7049 transitions. [2020-02-10 20:45:24,902 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7049 transitions. Word has length 28 [2020-02-10 20:45:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:24,902 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7049 transitions. [2020-02-10 20:45:24,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7049 transitions. [2020-02-10 20:45:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:24,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:24,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:24,905 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1989724182, now seen corresponding path program 340 times [2020-02-10 20:45:24,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:24,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341454856] [2020-02-10 20:45:24,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:25,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341454856] [2020-02-10 20:45:25,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:25,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:25,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927526804] [2020-02-10 20:45:25,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:25,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:25,423 INFO L87 Difference]: Start difference. First operand 1574 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:45:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:25,613 INFO L93 Difference]: Finished difference Result 2935 states and 11684 transitions. [2020-02-10 20:45:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:25,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:25,621 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:45:25,621 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:45:25,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:45:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1570. [2020-02-10 20:45:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7038 transitions. [2020-02-10 20:45:25,689 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7038 transitions. Word has length 28 [2020-02-10 20:45:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:25,690 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7038 transitions. [2020-02-10 20:45:25,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7038 transitions. [2020-02-10 20:45:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:25,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:25,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:25,693 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 937374080, now seen corresponding path program 341 times [2020-02-10 20:45:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:25,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282667665] [2020-02-10 20:45:25,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:26,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282667665] [2020-02-10 20:45:26,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:26,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:26,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673039277] [2020-02-10 20:45:26,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:26,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:26,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:26,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:26,222 INFO L87 Difference]: Start difference. First operand 1570 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:45:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:26,374 INFO L93 Difference]: Finished difference Result 2946 states and 11704 transitions. [2020-02-10 20:45:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:26,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:26,399 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:45:26,399 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:45:26,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:45:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1575. [2020-02-10 20:45:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:45:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 20:45:26,466 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 20:45:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:26,467 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 20:45:26,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 20:45:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:26,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:26,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:26,469 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash -378783224, now seen corresponding path program 342 times [2020-02-10 20:45:26,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:26,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115672591] [2020-02-10 20:45:26,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:26,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115672591] [2020-02-10 20:45:26,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:26,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:26,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113703450] [2020-02-10 20:45:26,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:26,982 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:45:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:27,206 INFO L93 Difference]: Finished difference Result 2940 states and 11688 transitions. [2020-02-10 20:45:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:27,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:27,214 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:45:27,214 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:45:27,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:45:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1565. [2020-02-10 20:45:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:45:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7024 transitions. [2020-02-10 20:45:27,282 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7024 transitions. Word has length 28 [2020-02-10 20:45:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:27,282 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7024 transitions. [2020-02-10 20:45:27,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7024 transitions. [2020-02-10 20:45:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:27,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:27,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:27,285 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:27,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1821992972, now seen corresponding path program 343 times [2020-02-10 20:45:27,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:27,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291005219] [2020-02-10 20:45:27,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:27,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291005219] [2020-02-10 20:45:27,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:27,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:27,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681821336] [2020-02-10 20:45:27,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:27,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:27,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:27,821 INFO L87 Difference]: Start difference. First operand 1565 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:45:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:28,023 INFO L93 Difference]: Finished difference Result 2956 states and 11740 transitions. [2020-02-10 20:45:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:28,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:28,031 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:45:28,031 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:45:28,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:45:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1579. [2020-02-10 20:45:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:45:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7063 transitions. [2020-02-10 20:45:28,100 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7063 transitions. Word has length 28 [2020-02-10 20:45:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:28,100 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7063 transitions. [2020-02-10 20:45:28,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7063 transitions. [2020-02-10 20:45:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:28,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45: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] [2020-02-10 20:45:28,103 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1728271826, now seen corresponding path program 344 times [2020-02-10 20:45:28,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:28,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363671532] [2020-02-10 20:45:28,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:28,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363671532] [2020-02-10 20:45:28,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:28,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:28,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664514718] [2020-02-10 20:45:28,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:28,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:28,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:28,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:28,641 INFO L87 Difference]: Start difference. First operand 1579 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:45:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:28,805 INFO L93 Difference]: Finished difference Result 2960 states and 11741 transitions. [2020-02-10 20:45:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:28,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:28,813 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:45:28,813 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:45:28,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:45:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:45:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:45:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7043 transitions. [2020-02-10 20:45:28,879 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7043 transitions. Word has length 28 [2020-02-10 20:45:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:28,879 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7043 transitions. [2020-02-10 20:45:28,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7043 transitions. [2020-02-10 20:45:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:28,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:28,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] [2020-02-10 20:45:28,882 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1397263168, now seen corresponding path program 345 times [2020-02-10 20:45:28,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:28,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082859446] [2020-02-10 20:45:28,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:29,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082859446] [2020-02-10 20:45:29,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:29,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:29,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665869328] [2020-02-10 20:45:29,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:29,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:29,421 INFO L87 Difference]: Start difference. First operand 1572 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:45:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:29,612 INFO L93 Difference]: Finished difference Result 2952 states and 11726 transitions. [2020-02-10 20:45:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:29,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:29,620 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:45:29,620 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:45:29,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:45:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 20:45:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:45:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7054 transitions. [2020-02-10 20:45:29,689 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7054 transitions. Word has length 28 [2020-02-10 20:45:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:29,689 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7054 transitions. [2020-02-10 20:45:29,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7054 transitions. [2020-02-10 20:45:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:29,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:29,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:29,692 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash -479312978, now seen corresponding path program 346 times [2020-02-10 20:45:29,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:29,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829717145] [2020-02-10 20:45:29,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:30,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829717145] [2020-02-10 20:45:30,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:30,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:30,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877602881] [2020-02-10 20:45:30,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:30,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:30,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:30,217 INFO L87 Difference]: Start difference. First operand 1578 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:45:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:30,428 INFO L93 Difference]: Finished difference Result 2953 states and 11722 transitions. [2020-02-10 20:45:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:30,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:30,436 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:45:30,436 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:45:30,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:45:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 20:45:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:45:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7037 transitions. [2020-02-10 20:45:30,502 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7037 transitions. Word has length 28 [2020-02-10 20:45:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:30,502 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7037 transitions. [2020-02-10 20:45:30,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7037 transitions. [2020-02-10 20:45:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:30,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:30,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] [2020-02-10 20:45:30,505 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash 958380288, now seen corresponding path program 347 times [2020-02-10 20:45:30,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:30,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90912526] [2020-02-10 20:45:30,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:31,041 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:45:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:31,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90912526] [2020-02-10 20:45:31,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:31,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:31,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580424376] [2020-02-10 20:45:31,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:31,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:31,049 INFO L87 Difference]: Start difference. First operand 1572 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:45:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:31,203 INFO L93 Difference]: Finished difference Result 2962 states and 11739 transitions. [2020-02-10 20:45:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:31,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:31,210 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:45:31,210 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:45:31,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:45:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1580. [2020-02-10 20:45:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:45:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 20:45:31,279 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 20:45:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:31,279 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 20:45:31,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 20:45:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:31,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:31,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] [2020-02-10 20:45:31,282 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:31,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1131627980, now seen corresponding path program 348 times [2020-02-10 20:45:31,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:31,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210923406] [2020-02-10 20:45:31,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:31,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210923406] [2020-02-10 20:45:31,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:31,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:31,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985697074] [2020-02-10 20:45:31,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:31,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:31,809 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:45:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:31,985 INFO L93 Difference]: Finished difference Result 2959 states and 11726 transitions. [2020-02-10 20:45:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:31,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:32,012 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:45:32,013 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:45:32,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:45:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1565. [2020-02-10 20:45:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:45:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7019 transitions. [2020-02-10 20:45:32,078 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7019 transitions. Word has length 28 [2020-02-10 20:45:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:32,078 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7019 transitions. [2020-02-10 20:45:32,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7019 transitions. [2020-02-10 20:45:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:32,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:32,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:32,080 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1864005388, now seen corresponding path program 349 times [2020-02-10 20:45:32,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:32,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692773995] [2020-02-10 20:45:32,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:32,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692773995] [2020-02-10 20:45:32,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:32,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:32,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987577671] [2020-02-10 20:45:32,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:32,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:32,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:32,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:32,602 INFO L87 Difference]: Start difference. First operand 1565 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:45:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:32,783 INFO L93 Difference]: Finished difference Result 2931 states and 11675 transitions. [2020-02-10 20:45:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:32,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:32,791 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:45:32,791 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 20:45:32,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 20:45:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1573. [2020-02-10 20:45:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 20:45:32,859 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 20:45:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:32,859 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 20:45:32,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 20:45:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:32,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:32,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] [2020-02-10 20:45:32,862 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1292550582, now seen corresponding path program 350 times [2020-02-10 20:45:32,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:32,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839956683] [2020-02-10 20:45:32,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:33,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839956683] [2020-02-10 20:45:33,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:33,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:33,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714449285] [2020-02-10 20:45:33,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:33,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:33,379 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:45:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:33,557 INFO L93 Difference]: Finished difference Result 2929 states and 11667 transitions. [2020-02-10 20:45:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:33,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:33,564 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:45:33,564 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:45:33,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:45:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1569. [2020-02-10 20:45:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:45:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7030 transitions. [2020-02-10 20:45:33,630 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7030 transitions. Word has length 28 [2020-02-10 20:45:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:33,630 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7030 transitions. [2020-02-10 20:45:33,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7030 transitions. [2020-02-10 20:45:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:33,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:33,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:33,633 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash 790920008, now seen corresponding path program 351 times [2020-02-10 20:45:33,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:33,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730921631] [2020-02-10 20:45:33,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:34,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730921631] [2020-02-10 20:45:34,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:34,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:34,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142398863] [2020-02-10 20:45:34,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:34,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:34,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:34,157 INFO L87 Difference]: Start difference. First operand 1569 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:45:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:34,332 INFO L93 Difference]: Finished difference Result 2936 states and 11683 transitions. [2020-02-10 20:45:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:34,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:34,340 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:45:34,340 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:45:34,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:45:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 20:45:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:45:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 20:45:34,412 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 20:45:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:34,413 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 20:45:34,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 20:45:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:34,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:34,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:34,415 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1708870198, now seen corresponding path program 352 times [2020-02-10 20:45:34,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:34,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529197531] [2020-02-10 20:45:34,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:34,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529197531] [2020-02-10 20:45:34,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:34,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:34,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868550041] [2020-02-10 20:45:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:34,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:34,954 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:45:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:35,139 INFO L93 Difference]: Finished difference Result 2937 states and 11679 transitions. [2020-02-10 20:45:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:35,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:35,147 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 20:45:35,147 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:45:35,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:45:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1569. [2020-02-10 20:45:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:45:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7026 transitions. [2020-02-10 20:45:35,213 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7026 transitions. Word has length 28 [2020-02-10 20:45:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:35,214 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7026 transitions. [2020-02-10 20:45:35,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7026 transitions. [2020-02-10 20:45:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:35,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:35,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:35,216 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash -315764600, now seen corresponding path program 353 times [2020-02-10 20:45:35,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:35,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923467984] [2020-02-10 20:45:35,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:35,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923467984] [2020-02-10 20:45:35,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:35,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:35,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867187292] [2020-02-10 20:45:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:35,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:35,754 INFO L87 Difference]: Start difference. First operand 1569 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:45:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:35,965 INFO L93 Difference]: Finished difference Result 2930 states and 11665 transitions. [2020-02-10 20:45:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:35,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:35,973 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:45:35,973 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:45:35,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:45:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1573. [2020-02-10 20:45:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7033 transitions. [2020-02-10 20:45:36,042 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7033 transitions. Word has length 28 [2020-02-10 20:45:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:36,042 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7033 transitions. [2020-02-10 20:45:36,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7033 transitions. [2020-02-10 20:45:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:36,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:36,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:36,044 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1173640396, now seen corresponding path program 354 times [2020-02-10 20:45:36,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:36,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188547876] [2020-02-10 20:45:36,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:36,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188547876] [2020-02-10 20:45:36,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:36,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:36,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039265802] [2020-02-10 20:45:36,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:36,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:36,566 INFO L87 Difference]: Start difference. First operand 1573 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:45:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:36,750 INFO L93 Difference]: Finished difference Result 2933 states and 11667 transitions. [2020-02-10 20:45:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:36,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:36,757 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:45:36,758 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:45:36,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:45:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1565. [2020-02-10 20:45:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:45:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7015 transitions. [2020-02-10 20:45:36,825 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7015 transitions. Word has length 28 [2020-02-10 20:45:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:36,825 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7015 transitions. [2020-02-10 20:45:36,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7015 transitions. [2020-02-10 20:45:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:36,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:36,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:36,828 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1675756306, now seen corresponding path program 355 times [2020-02-10 20:45:36,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:36,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41566720] [2020-02-10 20:45:36,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:37,251 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-02-10 20:45:37,369 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:45:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:37,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41566720] [2020-02-10 20:45:37,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:37,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:37,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762782262] [2020-02-10 20:45:37,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:37,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:37,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:37,377 INFO L87 Difference]: Start difference. First operand 1565 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:45:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:37,521 INFO L93 Difference]: Finished difference Result 2948 states and 11704 transitions. [2020-02-10 20:45:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:37,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:37,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:37,529 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:45:37,529 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:45:37,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:45:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 20:45:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:45:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 20:45:37,615 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 20:45:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:37,615 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 20:45:37,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 20:45:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:37,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:37,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:37,618 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:37,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:37,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1303053686, now seen corresponding path program 356 times [2020-02-10 20:45:37,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:37,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056862745] [2020-02-10 20:45:37,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:38,133 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:45:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:38,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056862745] [2020-02-10 20:45:38,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:38,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:38,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960731000] [2020-02-10 20:45:38,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:38,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:38,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:38,142 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:45:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:38,346 INFO L93 Difference]: Finished difference Result 2942 states and 11688 transitions. [2020-02-10 20:45:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:38,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:38,354 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:45:38,354 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:45:38,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:45:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1570. [2020-02-10 20:45:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 20:45:38,420 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 20:45:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:38,421 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 20:45:38,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 20:45:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:38,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:38,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:38,423 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1546125610, now seen corresponding path program 357 times [2020-02-10 20:45:38,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:38,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775805766] [2020-02-10 20:45:38,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:38,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775805766] [2020-02-10 20:45:38,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:38,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:38,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148268062] [2020-02-10 20:45:38,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:38,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:38,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:38,960 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:45:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:39,122 INFO L93 Difference]: Finished difference Result 2954 states and 11714 transitions. [2020-02-10 20:45:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:39,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:39,129 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:45:39,129 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:45:39,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:45:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1578. [2020-02-10 20:45:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:45:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7042 transitions. [2020-02-10 20:45:39,196 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7042 transitions. Word has length 28 [2020-02-10 20:45:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:39,196 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7042 transitions. [2020-02-10 20:45:39,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7042 transitions. [2020-02-10 20:45:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:39,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:39,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:39,198 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:39,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1719373302, now seen corresponding path program 358 times [2020-02-10 20:45:39,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:39,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797474310] [2020-02-10 20:45:39,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:39,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797474310] [2020-02-10 20:45:39,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:39,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:39,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552496423] [2020-02-10 20:45:39,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:39,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:39,742 INFO L87 Difference]: Start difference. First operand 1578 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:45:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:39,969 INFO L93 Difference]: Finished difference Result 2951 states and 11701 transitions. [2020-02-10 20:45:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:39,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:39,977 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:45:39,977 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:45:39,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:45:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1570. [2020-02-10 20:45:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:45:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 20:45:40,043 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 20:45:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:40,044 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 20:45:40,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 20:45:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:40,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:40,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:40,046 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1916202454, now seen corresponding path program 359 times [2020-02-10 20:45:40,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:40,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369140289] [2020-02-10 20:45:40,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:40,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369140289] [2020-02-10 20:45:40,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:40,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:40,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555364245] [2020-02-10 20:45:40,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:40,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:40,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:40,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:40,568 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:45:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:40,748 INFO L93 Difference]: Finished difference Result 2938 states and 11676 transitions. [2020-02-10 20:45:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:40,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:40,755 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:45:40,756 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:45:40,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:45:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1574. [2020-02-10 20:45:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 20:45:40,822 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 20:45:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:40,822 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 20:45:40,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 20:45:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:40,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:40,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] [2020-02-10 20:45:40,825 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -426797458, now seen corresponding path program 360 times [2020-02-10 20:45:40,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:40,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333711820] [2020-02-10 20:45:40,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:41,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333711820] [2020-02-10 20:45:41,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:41,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:41,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101948134] [2020-02-10 20:45:41,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:41,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:41,348 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:45:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:41,560 INFO L93 Difference]: Finished difference Result 2941 states and 11678 transitions. [2020-02-10 20:45:41,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:41,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:41,567 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:45:41,568 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:45:41,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:45:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1555. [2020-02-10 20:45:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:45:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6992 transitions. [2020-02-10 20:45:41,634 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6992 transitions. Word has length 28 [2020-02-10 20:45:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:41,634 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6992 transitions. [2020-02-10 20:45:41,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6992 transitions. [2020-02-10 20:45:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:41,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:41,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] [2020-02-10 20:45:41,636 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:41,637 INFO L82 PathProgramCache]: Analyzing trace with hash 313455144, now seen corresponding path program 361 times [2020-02-10 20:45:41,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:41,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904893044] [2020-02-10 20:45:41,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:42,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904893044] [2020-02-10 20:45:42,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:42,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986906542] [2020-02-10 20:45:42,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:42,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:42,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:42,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:42,163 INFO L87 Difference]: Start difference. First operand 1555 states and 6992 transitions. Second operand 11 states. [2020-02-10 20:45:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:42,380 INFO L93 Difference]: Finished difference Result 2905 states and 11627 transitions. [2020-02-10 20:45:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:42,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:42,387 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 20:45:42,387 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:45:42,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:45:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1573. [2020-02-10 20:45:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7062 transitions. [2020-02-10 20:45:42,454 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7062 transitions. Word has length 28 [2020-02-10 20:45:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:42,454 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7062 transitions. [2020-02-10 20:45:42,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7062 transitions. [2020-02-10 20:45:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:42,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:42,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:42,456 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1058157642, now seen corresponding path program 362 times [2020-02-10 20:45:42,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:42,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553182648] [2020-02-10 20:45:42,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:42,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553182648] [2020-02-10 20:45:42,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:42,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:42,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113770611] [2020-02-10 20:45:42,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:42,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:42,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:42,993 INFO L87 Difference]: Start difference. First operand 1573 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:45:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:43,199 INFO L93 Difference]: Finished difference Result 2906 states and 11624 transitions. [2020-02-10 20:45:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:43,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:43,207 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:45:43,207 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 20:45:43,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 20:45:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1568. [2020-02-10 20:45:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:45:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7048 transitions. [2020-02-10 20:45:43,292 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7048 transitions. Word has length 28 [2020-02-10 20:45:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:43,292 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7048 transitions. [2020-02-10 20:45:43,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7048 transitions. [2020-02-10 20:45:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:43,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:43,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] [2020-02-10 20:45:43,295 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash -759630236, now seen corresponding path program 363 times [2020-02-10 20:45:43,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:43,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721973117] [2020-02-10 20:45:43,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:43,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721973117] [2020-02-10 20:45:43,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:43,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:43,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087198395] [2020-02-10 20:45:43,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:43,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:43,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:43,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:43,826 INFO L87 Difference]: Start difference. First operand 1568 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:45:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:44,053 INFO L93 Difference]: Finished difference Result 2907 states and 11626 transitions. [2020-02-10 20:45:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:44,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:44,061 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:45:44,061 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:45:44,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:45:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1573. [2020-02-10 20:45:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:45:44,127 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:45:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:44,127 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:45:44,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:45:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:44,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:44,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:44,130 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1474477258, now seen corresponding path program 364 times [2020-02-10 20:45:44,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:44,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389402170] [2020-02-10 20:45:44,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:44,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389402170] [2020-02-10 20:45:44,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:44,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:44,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643157941] [2020-02-10 20:45:44,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:44,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:44,646 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:45:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:44,864 INFO L93 Difference]: Finished difference Result 2910 states and 11627 transitions. [2020-02-10 20:45:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:44,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:44,872 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:45:44,873 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 20:45:44,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 20:45:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1568. [2020-02-10 20:45:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:45:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 20:45:44,939 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 20:45:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:44,939 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 20:45:44,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 20:45:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:44,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:44,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] [2020-02-10 20:45:44,941 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1596013220, now seen corresponding path program 365 times [2020-02-10 20:45:44,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:44,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812309890] [2020-02-10 20:45:44,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:45,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812309890] [2020-02-10 20:45:45,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:45,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:45,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655907484] [2020-02-10 20:45:45,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:45,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:45,470 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:45:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:45,716 INFO L93 Difference]: Finished difference Result 2910 states and 11628 transitions. [2020-02-10 20:45:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:45,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:45,724 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:45:45,724 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:45:45,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:45:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1574. [2020-02-10 20:45:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:45:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:45:45,791 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:45:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:45,791 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:45:45,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:45:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:45,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:45,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:45,793 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1209549080, now seen corresponding path program 366 times [2020-02-10 20:45:45,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:45,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009293825] [2020-02-10 20:45:45,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:46,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009293825] [2020-02-10 20:45:46,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:46,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:46,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039609307] [2020-02-10 20:45:46,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:46,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:46,316 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:45:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:46,506 INFO L93 Difference]: Finished difference Result 2912 states and 11626 transitions. [2020-02-10 20:45:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:46,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:46,514 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:45:46,514 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:45:46,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:45:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1563. [2020-02-10 20:45:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:45:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7030 transitions. [2020-02-10 20:45:46,580 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7030 transitions. Word has length 28 [2020-02-10 20:45:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:46,580 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7030 transitions. [2020-02-10 20:45:46,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7030 transitions. [2020-02-10 20:45:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:46,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:46,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] [2020-02-10 20:45:46,582 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash -192891122, now seen corresponding path program 367 times [2020-02-10 20:45:46,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:46,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945067358] [2020-02-10 20:45:46,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:47,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945067358] [2020-02-10 20:45:47,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:47,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:47,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024886770] [2020-02-10 20:45:47,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:47,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:47,115 INFO L87 Difference]: Start difference. First operand 1563 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:45:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:47,302 INFO L93 Difference]: Finished difference Result 2897 states and 11602 transitions. [2020-02-10 20:45:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:47,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:47,310 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:45:47,310 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:45:47,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:45:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1572. [2020-02-10 20:45:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:45:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7054 transitions. [2020-02-10 20:45:47,376 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7054 transitions. Word has length 28 [2020-02-10 20:45:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:47,377 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7054 transitions. [2020-02-10 20:45:47,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7054 transitions. [2020-02-10 20:45:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:47,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:47,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:47,379 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 551811376, now seen corresponding path program 368 times [2020-02-10 20:45:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:47,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580096142] [2020-02-10 20:45:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:47,897 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:45:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580096142] [2020-02-10 20:45:47,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:47,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:47,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606886632] [2020-02-10 20:45:47,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:47,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:47,905 INFO L87 Difference]: Start difference. First operand 1572 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:45:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:48,117 INFO L93 Difference]: Finished difference Result 2898 states and 11599 transitions. [2020-02-10 20:45:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:48,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:48,125 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:45:48,125 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:45:48,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:45:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1567. [2020-02-10 20:45:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:45:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7041 transitions. [2020-02-10 20:45:48,192 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7041 transitions. Word has length 28 [2020-02-10 20:45:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:48,192 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7041 transitions. [2020-02-10 20:45:48,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7041 transitions. [2020-02-10 20:45:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:48,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:48,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:48,194 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash -728120924, now seen corresponding path program 369 times [2020-02-10 20:45:48,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:48,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595968763] [2020-02-10 20:45:48,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:48,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595968763] [2020-02-10 20:45:48,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:48,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:48,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802275539] [2020-02-10 20:45:48,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:48,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:48,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:48,720 INFO L87 Difference]: Start difference. First operand 1567 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:45:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:48,945 INFO L93 Difference]: Finished difference Result 2894 states and 11591 transitions. [2020-02-10 20:45:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:48,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:48,953 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:45:48,954 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:45:48,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:45:49,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 20:45:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7048 transitions. [2020-02-10 20:45:49,019 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7048 transitions. Word has length 28 [2020-02-10 20:45:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:49,019 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7048 transitions. [2020-02-10 20:45:49,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7048 transitions. [2020-02-10 20:45:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:49,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:49,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:49,021 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -554873232, now seen corresponding path program 370 times [2020-02-10 20:45:49,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:49,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832153474] [2020-02-10 20:45:49,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:49,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832153474] [2020-02-10 20:45:49,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:49,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:49,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575500623] [2020-02-10 20:45:49,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:49,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:49,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:49,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:49,547 INFO L87 Difference]: Start difference. First operand 1571 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:45:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:49,767 INFO L93 Difference]: Finished difference Result 2893 states and 11585 transitions. [2020-02-10 20:45:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:49,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:49,774 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:45:49,774 INFO L226 Difference]: Without dead ends: 2875 [2020-02-10 20:45:49,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2020-02-10 20:45:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1567. [2020-02-10 20:45:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:45:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 20:45:49,841 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 20:45:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:49,842 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 20:45:49,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 20:45:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:49,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:49,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:49,844 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:49,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1627522532, now seen corresponding path program 371 times [2020-02-10 20:45:49,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:49,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397033054] [2020-02-10 20:45:49,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:50,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397033054] [2020-02-10 20:45:50,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:50,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:50,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440960011] [2020-02-10 20:45:50,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:50,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:50,364 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:45:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:50,575 INFO L93 Difference]: Finished difference Result 2896 states and 11591 transitions. [2020-02-10 20:45:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:50,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:50,582 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:45:50,582 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 20:45:50,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 20:45:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1571. [2020-02-10 20:45:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 20:45:50,648 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 20:45:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:50,648 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 20:45:50,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 20:45:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:50,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:50,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:50,651 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1056067726, now seen corresponding path program 372 times [2020-02-10 20:45:50,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:50,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541147823] [2020-02-10 20:45:50,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:51,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541147823] [2020-02-10 20:45:51,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:51,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:51,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910615838] [2020-02-10 20:45:51,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:51,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:51,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:51,177 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:45:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:51,364 INFO L93 Difference]: Finished difference Result 2894 states and 11583 transitions. [2020-02-10 20:45:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:51,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:51,371 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:45:51,371 INFO L226 Difference]: Without dead ends: 2872 [2020-02-10 20:45:51,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2020-02-10 20:45:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1563. [2020-02-10 20:45:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:45:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7026 transitions. [2020-02-10 20:45:51,438 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7026 transitions. Word has length 28 [2020-02-10 20:45:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:51,438 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7026 transitions. [2020-02-10 20:45:51,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7026 transitions. [2020-02-10 20:45:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:51,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:51,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:51,441 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash -171884914, now seen corresponding path program 373 times [2020-02-10 20:45:51,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:51,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16074285] [2020-02-10 20:45:51,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:51,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16074285] [2020-02-10 20:45:51,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:51,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:51,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140645762] [2020-02-10 20:45:51,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:51,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:51,956 INFO L87 Difference]: Start difference. First operand 1563 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:45:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:52,135 INFO L93 Difference]: Finished difference Result 2901 states and 11606 transitions. [2020-02-10 20:45:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:52,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:52,143 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:45:52,143 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:45:52,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:45:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1572. [2020-02-10 20:45:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:45:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7050 transitions. [2020-02-10 20:45:52,210 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7050 transitions. Word has length 28 [2020-02-10 20:45:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:52,210 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7050 transitions. [2020-02-10 20:45:52,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7050 transitions. [2020-02-10 20:45:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:52,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:52,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:52,212 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2062222580, now seen corresponding path program 374 times [2020-02-10 20:45:52,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840122681] [2020-02-10 20:45:52,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:52,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840122681] [2020-02-10 20:45:52,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:52,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:52,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109798842] [2020-02-10 20:45:52,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:52,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:52,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:52,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:52,732 INFO L87 Difference]: Start difference. First operand 1572 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:45:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:52,946 INFO L93 Difference]: Finished difference Result 2904 states and 11607 transitions. [2020-02-10 20:45:52,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:52,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:52,953 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:45:52,953 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:45:52,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:45:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 20:45:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:45:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 20:45:53,019 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 20:45:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:53,019 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 20:45:53,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 20:45:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:53,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:53,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:53,022 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:53,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash 365970664, now seen corresponding path program 375 times [2020-02-10 20:45:53,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:53,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550683802] [2020-02-10 20:45:53,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:53,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550683802] [2020-02-10 20:45:53,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:53,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:53,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751872938] [2020-02-10 20:45:53,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:53,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:53,549 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:45:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:53,743 INFO L93 Difference]: Finished difference Result 2896 states and 11591 transitions. [2020-02-10 20:45:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:53,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:53,751 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:45:53,751 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:45:53,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:45:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1571. [2020-02-10 20:45:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 20:45:53,818 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 20:45:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:53,818 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 20:45:53,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 20:45:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:53,821 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:53,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:53,821 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 539218356, now seen corresponding path program 376 times [2020-02-10 20:45:53,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:53,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270658729] [2020-02-10 20:45:53,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:54,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270658729] [2020-02-10 20:45:54,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:54,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:54,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297052812] [2020-02-10 20:45:54,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:54,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:54,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:54,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:54,347 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:45:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:54,538 INFO L93 Difference]: Finished difference Result 2895 states and 11585 transitions. [2020-02-10 20:45:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:54,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:54,547 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 20:45:54,547 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:45:54,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:45:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1567. [2020-02-10 20:45:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:45:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:45:54,635 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:45:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:54,635 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:45:54,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:45:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:54,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:54,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:54,638 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1157033560, now seen corresponding path program 377 times [2020-02-10 20:45:54,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:54,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803186878] [2020-02-10 20:45:54,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:55,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803186878] [2020-02-10 20:45:55,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:55,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:55,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354074056] [2020-02-10 20:45:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:55,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:55,160 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:45:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:55,362 INFO L93 Difference]: Finished difference Result 2902 states and 11599 transitions. [2020-02-10 20:45:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:55,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:55,370 INFO L225 Difference]: With dead ends: 2902 [2020-02-10 20:45:55,370 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:45:55,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:45:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 20:45:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:45:55,436 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:45:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:55,436 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:45:55,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:45:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:55,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:55,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:55,439 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1077073934, now seen corresponding path program 378 times [2020-02-10 20:45:55,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:55,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994534218] [2020-02-10 20:45:55,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:55,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994534218] [2020-02-10 20:45:55,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:55,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:55,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814271216] [2020-02-10 20:45:55,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:55,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:55,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:55,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:55,948 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:45:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:56,195 INFO L93 Difference]: Finished difference Result 2898 states and 11587 transitions. [2020-02-10 20:45:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:56,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:56,203 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:45:56,203 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 20:45:56,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 20:45:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1563. [2020-02-10 20:45:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:45:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7022 transitions. [2020-02-10 20:45:56,269 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7022 transitions. Word has length 28 [2020-02-10 20:45:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:56,269 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7022 transitions. [2020-02-10 20:45:56,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7022 transitions. [2020-02-10 20:45:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:56,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:56,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] [2020-02-10 20:45:56,272 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash 583320688, now seen corresponding path program 379 times [2020-02-10 20:45:56,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:56,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669926735] [2020-02-10 20:45:56,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:56,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669926735] [2020-02-10 20:45:56,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:56,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:56,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868420720] [2020-02-10 20:45:56,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:56,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:56,784 INFO L87 Difference]: Start difference. First operand 1563 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:45:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:57,046 INFO L93 Difference]: Finished difference Result 2906 states and 11614 transitions. [2020-02-10 20:45:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:57,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:57,055 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:45:57,055 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:45:57,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:45:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1573. [2020-02-10 20:45:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:45:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7048 transitions. [2020-02-10 20:45:57,125 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7048 transitions. Word has length 28 [2020-02-10 20:45:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:57,125 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7048 transitions. [2020-02-10 20:45:57,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7048 transitions. [2020-02-10 20:45:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:57,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:57,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] [2020-02-10 20:45:57,128 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2072725684, now seen corresponding path program 380 times [2020-02-10 20:45:57,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:57,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064152268] [2020-02-10 20:45:57,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:57,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064152268] [2020-02-10 20:45:57,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:57,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:57,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113046969] [2020-02-10 20:45:57,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:57,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:57,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:57,637 INFO L87 Difference]: Start difference. First operand 1573 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:45:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:57,904 INFO L93 Difference]: Finished difference Result 2908 states and 11612 transitions. [2020-02-10 20:45:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:57,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:57,912 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:45:57,912 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:45:57,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:45:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1567. [2020-02-10 20:45:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:45:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:45:57,978 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:45:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:57,978 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:45:57,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:45:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:57,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:57,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] [2020-02-10 20:45:57,980 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1121176266, now seen corresponding path program 381 times [2020-02-10 20:45:57,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:57,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967952399] [2020-02-10 20:45:57,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:58,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967952399] [2020-02-10 20:45:58,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:58,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:58,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536257865] [2020-02-10 20:45:58,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:58,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:58,489 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:45:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:58,688 INFO L93 Difference]: Finished difference Result 2900 states and 11596 transitions. [2020-02-10 20:45:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:58,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:58,695 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:45:58,695 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:45:58,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:45:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 20:45:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:45:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:45:58,761 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:45:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:58,761 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:45:58,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:45:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:58,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:58,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:58,764 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 549721460, now seen corresponding path program 382 times [2020-02-10 20:45:58,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:58,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136848795] [2020-02-10 20:45:58,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:59,282 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:45:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:59,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136848795] [2020-02-10 20:45:59,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:59,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:45:59,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963207669] [2020-02-10 20:45:59,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:45:59,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:45:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:59,290 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:45:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:59,558 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 20:45:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:45:59,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:45:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:59,566 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:45:59,566 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 20:45:59,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:45:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 20:45:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1567. [2020-02-10 20:45:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:45:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:45:59,632 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:45:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:59,632 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:45:59,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:45:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:45:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:45:59,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:59,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:59,634 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:45:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1537495882, now seen corresponding path program 383 times [2020-02-10 20:45:59,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:59,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228329078] [2020-02-10 20:45:59,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:00,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228329078] [2020-02-10 20:46:00,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:00,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:00,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321431420] [2020-02-10 20:46:00,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:00,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:00,154 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:46:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:00,438 INFO L93 Difference]: Finished difference Result 2904 states and 11600 transitions. [2020-02-10 20:46:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:00,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:00,445 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:46:00,445 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:46:00,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:46:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1571. [2020-02-10 20:46:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:46:00,512 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:46:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:00,512 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:46:00,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:46:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:00,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:00,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:00,515 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:00,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:00,515 INFO L82 PathProgramCache]: Analyzing trace with hash -523363920, now seen corresponding path program 384 times [2020-02-10 20:46:00,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:00,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547395326] [2020-02-10 20:46:00,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:01,030 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:46:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:01,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547395326] [2020-02-10 20:46:01,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:01,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:01,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687214014] [2020-02-10 20:46:01,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:01,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:01,038 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:46:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:01,242 INFO L93 Difference]: Finished difference Result 2900 states and 11588 transitions. [2020-02-10 20:46:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:01,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:01,250 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:46:01,250 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 20:46:01,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 20:46:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1559. [2020-02-10 20:46:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:46:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7011 transitions. [2020-02-10 20:46:01,315 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7011 transitions. Word has length 28 [2020-02-10 20:46:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:01,315 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7011 transitions. [2020-02-10 20:46:01,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7011 transitions. [2020-02-10 20:46:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:01,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:01,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:01,318 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:01,318 INFO L82 PathProgramCache]: Analyzing trace with hash -129443996, now seen corresponding path program 385 times [2020-02-10 20:46:01,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:01,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300019127] [2020-02-10 20:46:01,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:01,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300019127] [2020-02-10 20:46:01,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:01,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:01,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035246712] [2020-02-10 20:46:01,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:01,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:01,844 INFO L87 Difference]: Start difference. First operand 1559 states and 7011 transitions. Second operand 11 states. [2020-02-10 20:46:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:02,058 INFO L93 Difference]: Finished difference Result 2919 states and 11668 transitions. [2020-02-10 20:46:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:02,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:02,065 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:46:02,065 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:46:02,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:46:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 20:46:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 20:46:02,132 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 20:46:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:02,132 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 20:46:02,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 20:46:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:02,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:02,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] [2020-02-10 20:46:02,134 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 615258502, now seen corresponding path program 386 times [2020-02-10 20:46:02,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:02,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674353353] [2020-02-10 20:46:02,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:02,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674353353] [2020-02-10 20:46:02,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:02,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:02,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36207886] [2020-02-10 20:46:02,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:02,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:02,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:02,668 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:46:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:02,882 INFO L93 Difference]: Finished difference Result 2920 states and 11665 transitions. [2020-02-10 20:46:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:02,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:02,890 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:46:02,890 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:46:02,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:46:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 20:46:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:46:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7049 transitions. [2020-02-10 20:46:02,958 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7049 transitions. Word has length 28 [2020-02-10 20:46:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:02,958 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7049 transitions. [2020-02-10 20:46:02,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7049 transitions. [2020-02-10 20:46:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:02,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:02,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] [2020-02-10 20:46:02,961 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:02,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1202529376, now seen corresponding path program 387 times [2020-02-10 20:46:02,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:02,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790563341] [2020-02-10 20:46:02,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:03,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790563341] [2020-02-10 20:46:03,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:03,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:03,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056192868] [2020-02-10 20:46:03,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:03,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:03,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:03,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:03,474 INFO L87 Difference]: Start difference. First operand 1569 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:46:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:03,738 INFO L93 Difference]: Finished difference Result 2921 states and 11667 transitions. [2020-02-10 20:46:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:03,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:03,746 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:46:03,746 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:46:03,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:46:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1574. [2020-02-10 20:46:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 20:46:03,812 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 20:46:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:03,812 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 20:46:03,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 20:46:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:03,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:03,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:03,815 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1031578118, now seen corresponding path program 388 times [2020-02-10 20:46:03,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:03,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197451136] [2020-02-10 20:46:03,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:04,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197451136] [2020-02-10 20:46:04,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:04,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:04,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876303656] [2020-02-10 20:46:04,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:04,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:04,329 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:46:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:04,600 INFO L93 Difference]: Finished difference Result 2924 states and 11668 transitions. [2020-02-10 20:46:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:04,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:04,607 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:46:04,608 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:46:04,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:46:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 20:46:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:46:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 20:46:04,675 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 20:46:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:04,675 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 20:46:04,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 20:46:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:04,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:04,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:04,678 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1153114080, now seen corresponding path program 389 times [2020-02-10 20:46:04,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:04,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828148200] [2020-02-10 20:46:04,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:05,226 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:05,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828148200] [2020-02-10 20:46:05,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:05,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:05,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641916862] [2020-02-10 20:46:05,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:05,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:05,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:05,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:05,234 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:46:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:05,403 INFO L93 Difference]: Finished difference Result 2924 states and 11669 transitions. [2020-02-10 20:46:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:05,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:05,411 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:46:05,411 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:46:05,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:46:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1575. [2020-02-10 20:46:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:46:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7055 transitions. [2020-02-10 20:46:05,479 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7055 transitions. Word has length 28 [2020-02-10 20:46:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:05,479 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7055 transitions. [2020-02-10 20:46:05,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7055 transitions. [2020-02-10 20:46:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:05,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:05,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:05,482 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448220, now seen corresponding path program 390 times [2020-02-10 20:46:05,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:05,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975133679] [2020-02-10 20:46:05,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:06,001 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:06,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975133679] [2020-02-10 20:46:06,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:06,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:06,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891110995] [2020-02-10 20:46:06,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:06,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:06,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:06,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:06,009 INFO L87 Difference]: Start difference. First operand 1575 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:46:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:06,196 INFO L93 Difference]: Finished difference Result 2926 states and 11667 transitions. [2020-02-10 20:46:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:06,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:06,204 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:46:06,204 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:46:06,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:46:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1564. [2020-02-10 20:46:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:46:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7030 transitions. [2020-02-10 20:46:06,271 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7030 transitions. Word has length 28 [2020-02-10 20:46:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:06,272 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7030 transitions. [2020-02-10 20:46:06,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7030 transitions. [2020-02-10 20:46:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:06,274 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:06,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] [2020-02-10 20:46:06,274 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:06,274 INFO L82 PathProgramCache]: Analyzing trace with hash 458301326, now seen corresponding path program 391 times [2020-02-10 20:46:06,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:06,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682811073] [2020-02-10 20:46:06,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:06,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682811073] [2020-02-10 20:46:06,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:06,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:06,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168009835] [2020-02-10 20:46:06,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:06,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:06,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:06,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:06,809 INFO L87 Difference]: Start difference. First operand 1564 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:46:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:06,987 INFO L93 Difference]: Finished difference Result 2918 states and 11661 transitions. [2020-02-10 20:46:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:06,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:06,994 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:46:06,994 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:46:06,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:46:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1574. [2020-02-10 20:46:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 20:46:07,061 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 20:46:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:07,061 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 20:46:07,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 20:46:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:07,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:07,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] [2020-02-10 20:46:07,063 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1203003824, now seen corresponding path program 392 times [2020-02-10 20:46:07,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:07,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201224546] [2020-02-10 20:46:07,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:07,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201224546] [2020-02-10 20:46:07,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:07,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:07,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956623526] [2020-02-10 20:46:07,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:07,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:07,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:07,609 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:46:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:07,785 INFO L93 Difference]: Finished difference Result 2919 states and 11658 transitions. [2020-02-10 20:46:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:07,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:07,793 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:46:07,793 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:46:07,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:46:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1569. [2020-02-10 20:46:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:46:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 20:46:07,859 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 20:46:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:07,860 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 20:46:07,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 20:46:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:07,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:07,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:07,862 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1150013856, now seen corresponding path program 393 times [2020-02-10 20:46:07,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:07,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841041087] [2020-02-10 20:46:07,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:08,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841041087] [2020-02-10 20:46:08,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:08,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:08,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256379103] [2020-02-10 20:46:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:08,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:08,398 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:46:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:08,581 INFO L93 Difference]: Finished difference Result 2919 states and 11658 transitions. [2020-02-10 20:46:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:08,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:08,589 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:46:08,589 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 20:46:08,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 20:46:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 20:46:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 20:46:08,655 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 20:46:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:08,655 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 20:46:08,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 20:46:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:08,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:08,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] [2020-02-10 20:46:08,658 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash 512638832, now seen corresponding path program 394 times [2020-02-10 20:46:08,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:08,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132589940] [2020-02-10 20:46:08,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:09,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132589940] [2020-02-10 20:46:09,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:09,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:09,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472444660] [2020-02-10 20:46:09,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:09,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:09,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:09,200 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:46:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:09,382 INFO L93 Difference]: Finished difference Result 2921 states and 11657 transitions. [2020-02-10 20:46:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:09,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:09,390 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:46:09,390 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:46:09,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:46:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 20:46:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:46:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 20:46:09,456 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 20:46:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:09,456 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 20:46:09,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 20:46:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:09,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:09,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:09,459 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1205629600, now seen corresponding path program 395 times [2020-02-10 20:46:09,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:09,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089237411] [2020-02-10 20:46:09,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:09,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089237411] [2020-02-10 20:46:09,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:09,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:09,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5018161] [2020-02-10 20:46:09,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:09,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:09,997 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:46:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:10,173 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 20:46:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:10,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:10,181 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:46:10,181 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:46:10,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:46:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1575. [2020-02-10 20:46:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:46:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 20:46:10,251 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 20:46:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:10,251 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 20:46:10,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 20:46:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:10,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:10,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:10,254 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2123579790, now seen corresponding path program 396 times [2020-02-10 20:46:10,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:10,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063642004] [2020-02-10 20:46:10,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:10,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063642004] [2020-02-10 20:46:10,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:10,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:10,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528114675] [2020-02-10 20:46:10,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:10,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:10,801 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:46:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:11,005 INFO L93 Difference]: Finished difference Result 2923 states and 11656 transitions. [2020-02-10 20:46:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:11,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:11,012 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:46:11,012 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:46:11,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:46:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1564. [2020-02-10 20:46:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:46:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7025 transitions. [2020-02-10 20:46:11,078 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7025 transitions. Word has length 28 [2020-02-10 20:46:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:11,078 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7025 transitions. [2020-02-10 20:46:11,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7025 transitions. [2020-02-10 20:46:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:11,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:11,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:11,081 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash 479307534, now seen corresponding path program 397 times [2020-02-10 20:46:11,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:11,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117949440] [2020-02-10 20:46:11,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:11,617 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:11,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117949440] [2020-02-10 20:46:11,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:11,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:11,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457569911] [2020-02-10 20:46:11,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:11,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:11,625 INFO L87 Difference]: Start difference. First operand 1564 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:46:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:11,821 INFO L93 Difference]: Finished difference Result 2923 states and 11667 transitions. [2020-02-10 20:46:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:11,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:11,828 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 20:46:11,828 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:46:11,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:46:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1574. [2020-02-10 20:46:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 20:46:11,914 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 20:46:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:11,914 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 20:46:11,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 20:46:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:11,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:11,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] [2020-02-10 20:46:11,917 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:11,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1581552268, now seen corresponding path program 398 times [2020-02-10 20:46:11,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:11,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540280459] [2020-02-10 20:46:11,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:12,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540280459] [2020-02-10 20:46:12,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:12,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:12,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365487091] [2020-02-10 20:46:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:12,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:12,432 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:46:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:12,607 INFO L93 Difference]: Finished difference Result 2926 states and 11668 transitions. [2020-02-10 20:46:12,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:12,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:12,615 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:46:12,615 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:46:12,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:46:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1569. [2020-02-10 20:46:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:46:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 20:46:12,683 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 20:46:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:12,683 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 20:46:12,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 20:46:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:12,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:12,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] [2020-02-10 20:46:12,686 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash -55922268, now seen corresponding path program 399 times [2020-02-10 20:46:12,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:12,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523873935] [2020-02-10 20:46:12,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:13,206 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:46:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:13,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523873935] [2020-02-10 20:46:13,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:13,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:13,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920927685] [2020-02-10 20:46:13,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:13,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:13,213 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:46:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:13,394 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 20:46:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:13,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:13,401 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:46:13,401 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:46:13,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:46:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1574. [2020-02-10 20:46:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7048 transitions. [2020-02-10 20:46:13,470 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7048 transitions. Word has length 28 [2020-02-10 20:46:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:13,470 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7048 transitions. [2020-02-10 20:46:13,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7048 transitions. [2020-02-10 20:46:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:13,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:13,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:13,472 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1606730420, now seen corresponding path program 400 times [2020-02-10 20:46:13,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:13,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107417344] [2020-02-10 20:46:13,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:13,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107417344] [2020-02-10 20:46:13,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:13,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:13,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961407584] [2020-02-10 20:46:13,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:13,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:13,996 INFO L87 Difference]: Start difference. First operand 1574 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:46:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:14,182 INFO L93 Difference]: Finished difference Result 2924 states and 11659 transitions. [2020-02-10 20:46:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:14,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:14,189 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:46:14,190 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:46:14,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:46:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1569. [2020-02-10 20:46:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:46:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7034 transitions. [2020-02-10 20:46:14,256 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7034 transitions. Word has length 28 [2020-02-10 20:46:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:14,256 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7034 transitions. [2020-02-10 20:46:14,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7034 transitions. [2020-02-10 20:46:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:14,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:14,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] [2020-02-10 20:46:14,258 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1578926492, now seen corresponding path program 401 times [2020-02-10 20:46:14,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:14,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763819463] [2020-02-10 20:46:14,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:14,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763819463] [2020-02-10 20:46:14,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:14,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:14,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044326704] [2020-02-10 20:46:14,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:14,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:14,784 INFO L87 Difference]: Start difference. First operand 1569 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:46:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:14,995 INFO L93 Difference]: Finished difference Result 2930 states and 11673 transitions. [2020-02-10 20:46:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:14,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:15,003 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:46:15,003 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:46:15,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:46:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1576. [2020-02-10 20:46:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:46:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7047 transitions. [2020-02-10 20:46:15,070 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7047 transitions. Word has length 28 [2020-02-10 20:46:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:15,070 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7047 transitions. [2020-02-10 20:46:15,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7047 transitions. [2020-02-10 20:46:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:15,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:15,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] [2020-02-10 20:46:15,073 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2144585998, now seen corresponding path program 402 times [2020-02-10 20:46:15,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:15,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455379947] [2020-02-10 20:46:15,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:15,597 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:46:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:15,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455379947] [2020-02-10 20:46:15,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:15,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:15,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401038297] [2020-02-10 20:46:15,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:15,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:15,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:15,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:15,605 INFO L87 Difference]: Start difference. First operand 1576 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:46:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:15,786 INFO L93 Difference]: Finished difference Result 2929 states and 11664 transitions. [2020-02-10 20:46:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:15,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:15,793 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:46:15,793 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:46:15,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:46:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1564. [2020-02-10 20:46:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:46:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 20:46:15,859 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 20:46:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:15,860 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 20:46:15,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 20:46:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:15,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:15,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:15,862 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1234513136, now seen corresponding path program 403 times [2020-02-10 20:46:15,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:15,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3659655] [2020-02-10 20:46:15,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:16,390 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:16,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3659655] [2020-02-10 20:46:16,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:16,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:16,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266099387] [2020-02-10 20:46:16,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:16,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:16,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:16,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:16,398 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:46:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:16,579 INFO L93 Difference]: Finished difference Result 2930 states and 11681 transitions. [2020-02-10 20:46:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:16,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:16,587 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:46:16,587 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:46:16,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:46:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1576. [2020-02-10 20:46:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:46:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:46:16,658 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:46:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:16,658 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:46:16,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:46:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:16,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:16,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:16,661 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1571049164, now seen corresponding path program 404 times [2020-02-10 20:46:16,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:16,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689825556] [2020-02-10 20:46:16,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:17,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689825556] [2020-02-10 20:46:17,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:17,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:17,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309430539] [2020-02-10 20:46:17,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:17,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:17,199 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:46:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:17,397 INFO L93 Difference]: Finished difference Result 2932 states and 11679 transitions. [2020-02-10 20:46:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:17,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:17,405 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:46:17,405 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:46:17,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:46:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1570. [2020-02-10 20:46:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:46:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7037 transitions. [2020-02-10 20:46:17,471 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7037 transitions. Word has length 28 [2020-02-10 20:46:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:17,472 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7037 transitions. [2020-02-10 20:46:17,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7037 transitions. [2020-02-10 20:46:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:17,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:17,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:17,497 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 699283334, now seen corresponding path program 405 times [2020-02-10 20:46:17,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:17,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345700221] [2020-02-10 20:46:17,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:18,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345700221] [2020-02-10 20:46:18,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:18,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:18,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481817435] [2020-02-10 20:46:18,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:18,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:18,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:18,040 INFO L87 Difference]: Start difference. First operand 1570 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:46:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:18,223 INFO L93 Difference]: Finished difference Result 2929 states and 11673 transitions. [2020-02-10 20:46:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:18,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:18,231 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:46:18,231 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:46:18,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:46:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1576. [2020-02-10 20:46:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:46:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7048 transitions. [2020-02-10 20:46:18,298 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7048 transitions. Word has length 28 [2020-02-10 20:46:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:18,299 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7048 transitions. [2020-02-10 20:46:18,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7048 transitions. [2020-02-10 20:46:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:18,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:18,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] [2020-02-10 20:46:18,301 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1617233524, now seen corresponding path program 406 times [2020-02-10 20:46:18,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:18,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023495804] [2020-02-10 20:46:18,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:18,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023495804] [2020-02-10 20:46:18,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:18,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:18,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389145765] [2020-02-10 20:46:18,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:18,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:18,842 INFO L87 Difference]: Start difference. First operand 1576 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:46:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:19,019 INFO L93 Difference]: Finished difference Result 2930 states and 11669 transitions. [2020-02-10 20:46:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:19,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:19,026 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 20:46:19,026 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:46:19,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:46:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1570. [2020-02-10 20:46:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:46:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 20:46:19,094 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 20:46:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:19,094 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 20:46:19,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 20:46:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:19,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:19,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:19,097 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1115602950, now seen corresponding path program 407 times [2020-02-10 20:46:19,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:19,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902675827] [2020-02-10 20:46:19,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:19,624 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:46:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:19,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902675827] [2020-02-10 20:46:19,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:19,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:19,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789136573] [2020-02-10 20:46:19,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:19,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:19,632 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:46:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:19,813 INFO L93 Difference]: Finished difference Result 2934 states and 11678 transitions. [2020-02-10 20:46:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:19,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:19,821 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:46:19,821 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:46:19,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:46:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1577. [2020-02-10 20:46:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:46:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7044 transitions. [2020-02-10 20:46:19,889 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7044 transitions. Word has length 28 [2020-02-10 20:46:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:19,889 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7044 transitions. [2020-02-10 20:46:19,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7044 transitions. [2020-02-10 20:46:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:19,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:19,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:19,891 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash 544148144, now seen corresponding path program 408 times [2020-02-10 20:46:19,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:19,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753478216] [2020-02-10 20:46:19,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:20,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753478216] [2020-02-10 20:46:20,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:20,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:20,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449492694] [2020-02-10 20:46:20,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:20,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:20,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:20,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:20,421 INFO L87 Difference]: Start difference. First operand 1577 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:46:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:20,603 INFO L93 Difference]: Finished difference Result 2933 states and 11669 transitions. [2020-02-10 20:46:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:20,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:20,611 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:46:20,611 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 20:46:20,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 20:46:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1559. [2020-02-10 20:46:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:46:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7007 transitions. [2020-02-10 20:46:20,677 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7007 transitions. Word has length 28 [2020-02-10 20:46:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:20,677 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7007 transitions. [2020-02-10 20:46:20,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7007 transitions. [2020-02-10 20:46:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:20,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:20,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:20,679 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash 847344676, now seen corresponding path program 409 times [2020-02-10 20:46:20,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:20,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472981510] [2020-02-10 20:46:20,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:21,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472981510] [2020-02-10 20:46:21,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:21,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:21,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311650518] [2020-02-10 20:46:21,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:21,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:21,228 INFO L87 Difference]: Start difference. First operand 1559 states and 7007 transitions. Second operand 11 states. [2020-02-10 20:46:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:21,407 INFO L93 Difference]: Finished difference Result 2896 states and 11596 transitions. [2020-02-10 20:46:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:21,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:21,415 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:46:21,415 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:46:21,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:46:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1572. [2020-02-10 20:46:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:46:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7050 transitions. [2020-02-10 20:46:21,484 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7050 transitions. Word has length 28 [2020-02-10 20:46:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:21,484 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7050 transitions. [2020-02-10 20:46:21,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7050 transitions. [2020-02-10 20:46:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:21,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:21,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] [2020-02-10 20:46:21,486 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:21,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1592047174, now seen corresponding path program 410 times [2020-02-10 20:46:21,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:21,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176325218] [2020-02-10 20:46:21,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:22,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176325218] [2020-02-10 20:46:22,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:22,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:22,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071214265] [2020-02-10 20:46:22,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:22,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:22,021 INFO L87 Difference]: Start difference. First operand 1572 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:46:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:22,218 INFO L93 Difference]: Finished difference Result 2897 states and 11593 transitions. [2020-02-10 20:46:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:22,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:22,226 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:46:22,226 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 20:46:22,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 20:46:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1567. [2020-02-10 20:46:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 20:46:22,294 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 20:46:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:22,294 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 20:46:22,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 20:46:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:22,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:22,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:22,296 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 312114874, now seen corresponding path program 411 times [2020-02-10 20:46:22,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:22,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78073371] [2020-02-10 20:46:22,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:22,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78073371] [2020-02-10 20:46:22,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:22,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:22,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48298420] [2020-02-10 20:46:22,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:22,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:22,833 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:46:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:23,044 INFO L93 Difference]: Finished difference Result 2893 states and 11585 transitions. [2020-02-10 20:46:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:23,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:23,052 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:46:23,052 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:46:23,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:46:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1571. [2020-02-10 20:46:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 20:46:23,118 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 20:46:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:23,118 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 20:46:23,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 20:46:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:23,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:23,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:23,120 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:23,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash 485362566, now seen corresponding path program 412 times [2020-02-10 20:46:23,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:23,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698589086] [2020-02-10 20:46:23,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:23,673 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:46:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:23,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698589086] [2020-02-10 20:46:23,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:23,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:23,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193459091] [2020-02-10 20:46:23,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:23,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:23,681 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:46:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:23,885 INFO L93 Difference]: Finished difference Result 2892 states and 11579 transitions. [2020-02-10 20:46:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:23,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:23,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:23,893 INFO L225 Difference]: With dead ends: 2892 [2020-02-10 20:46:23,893 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 20:46:23,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 20:46:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1567. [2020-02-10 20:46:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:46:23,959 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:46:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:23,959 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:46:23,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:46:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:23,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:23,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] [2020-02-10 20:46:23,961 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1627208966, now seen corresponding path program 413 times [2020-02-10 20:46:23,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:23,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982377350] [2020-02-10 20:46:23,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:24,483 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:24,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982377350] [2020-02-10 20:46:24,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:24,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:24,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684399010] [2020-02-10 20:46:24,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:24,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:24,491 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:46:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:24,668 INFO L93 Difference]: Finished difference Result 2895 states and 11585 transitions. [2020-02-10 20:46:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:24,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:24,676 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 20:46:24,676 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:46:24,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:46:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 20:46:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:46:24,743 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:46:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:24,743 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:46:24,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:46:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:24,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:24,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] [2020-02-10 20:46:24,746 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2096303524, now seen corresponding path program 414 times [2020-02-10 20:46:24,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:24,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607486636] [2020-02-10 20:46:24,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:25,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607486636] [2020-02-10 20:46:25,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:25,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:25,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750422278] [2020-02-10 20:46:25,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:25,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:25,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:25,269 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:46:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:25,443 INFO L93 Difference]: Finished difference Result 2893 states and 11577 transitions. [2020-02-10 20:46:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:25,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:25,451 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:46:25,451 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 20:46:25,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 20:46:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1563. [2020-02-10 20:46:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:46:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7022 transitions. [2020-02-10 20:46:25,519 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7022 transitions. Word has length 28 [2020-02-10 20:46:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:25,519 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7022 transitions. [2020-02-10 20:46:25,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7022 transitions. [2020-02-10 20:46:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:25,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:25,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] [2020-02-10 20:46:25,522 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:25,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:25,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1941436264, now seen corresponding path program 415 times [2020-02-10 20:46:25,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:25,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328349545] [2020-02-10 20:46:25,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:26,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328349545] [2020-02-10 20:46:26,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:26,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861672113] [2020-02-10 20:46:26,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:26,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:26,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:26,059 INFO L87 Difference]: Start difference. First operand 1563 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:46:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:26,236 INFO L93 Difference]: Finished difference Result 2903 states and 11611 transitions. [2020-02-10 20:46:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:26,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:26,244 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:46:26,244 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:46:26,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:46:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1573. [2020-02-10 20:46:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:46:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7050 transitions. [2020-02-10 20:46:26,313 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7050 transitions. Word has length 28 [2020-02-10 20:46:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:26,313 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7050 transitions. [2020-02-10 20:46:26,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7050 transitions. [2020-02-10 20:46:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:26,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:26,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:26,316 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1608828534, now seen corresponding path program 416 times [2020-02-10 20:46:26,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:26,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201022944] [2020-02-10 20:46:26,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:26,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201022944] [2020-02-10 20:46:26,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:26,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:26,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490392227] [2020-02-10 20:46:26,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:26,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:26,859 INFO L87 Difference]: Start difference. First operand 1573 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:46:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:27,042 INFO L93 Difference]: Finished difference Result 2904 states and 11608 transitions. [2020-02-10 20:46:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:27,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:27,049 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:46:27,049 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:46:27,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:46:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1568. [2020-02-10 20:46:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:46:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7036 transitions. [2020-02-10 20:46:27,117 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7036 transitions. Word has length 28 [2020-02-10 20:46:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:27,117 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7036 transitions. [2020-02-10 20:46:27,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7036 transitions. [2020-02-10 20:46:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:27,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:27,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] [2020-02-10 20:46:27,119 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash 333121082, now seen corresponding path program 417 times [2020-02-10 20:46:27,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:27,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629424736] [2020-02-10 20:46:27,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:27,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629424736] [2020-02-10 20:46:27,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:27,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:27,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52157206] [2020-02-10 20:46:27,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:27,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:27,651 INFO L87 Difference]: Start difference. First operand 1568 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:46:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:27,833 INFO L93 Difference]: Finished difference Result 2904 states and 11608 transitions. [2020-02-10 20:46:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:27,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:27,841 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:46:27,841 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:46:27,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:46:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1573. [2020-02-10 20:46:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:46:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 20:46:27,907 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 20:46:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:27,907 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 20:46:27,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 20:46:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:27,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:27,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] [2020-02-10 20:46:27,909 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1995773770, now seen corresponding path program 418 times [2020-02-10 20:46:27,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:27,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770948681] [2020-02-10 20:46:27,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:28,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770948681] [2020-02-10 20:46:28,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:28,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:28,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502308777] [2020-02-10 20:46:28,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:28,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:28,441 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:46:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:28,619 INFO L93 Difference]: Finished difference Result 2906 states and 11607 transitions. [2020-02-10 20:46:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:28,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:28,627 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:46:28,627 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:46:28,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:46:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1568. [2020-02-10 20:46:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:46:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7031 transitions. [2020-02-10 20:46:28,695 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7031 transitions. Word has length 28 [2020-02-10 20:46:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:28,695 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7031 transitions. [2020-02-10 20:46:28,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7031 transitions. [2020-02-10 20:46:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:28,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:28,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:28,698 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1606202758, now seen corresponding path program 419 times [2020-02-10 20:46:28,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:28,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692400455] [2020-02-10 20:46:28,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:29,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692400455] [2020-02-10 20:46:29,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:29,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:29,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018570546] [2020-02-10 20:46:29,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:29,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:29,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:29,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:29,256 INFO L87 Difference]: Start difference. First operand 1568 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:46:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:29,477 INFO L93 Difference]: Finished difference Result 2907 states and 11610 transitions. [2020-02-10 20:46:29,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:29,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:29,484 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:46:29,484 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 20:46:29,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 20:46:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1574. [2020-02-10 20:46:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7042 transitions. [2020-02-10 20:46:29,549 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7042 transitions. Word has length 28 [2020-02-10 20:46:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:29,549 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7042 transitions. [2020-02-10 20:46:29,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7042 transitions. [2020-02-10 20:46:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:29,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:29,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:29,552 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash -688252568, now seen corresponding path program 420 times [2020-02-10 20:46:29,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:29,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751704908] [2020-02-10 20:46:29,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:30,083 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:46:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:30,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751704908] [2020-02-10 20:46:30,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:30,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:30,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176188336] [2020-02-10 20:46:30,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:30,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:30,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:30,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:30,091 INFO L87 Difference]: Start difference. First operand 1574 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:46:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:30,276 INFO L93 Difference]: Finished difference Result 2908 states and 11606 transitions. [2020-02-10 20:46:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:30,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:30,284 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:46:30,284 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 20:46:30,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 20:46:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1563. [2020-02-10 20:46:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:46:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7018 transitions. [2020-02-10 20:46:30,350 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7018 transitions. Word has length 28 [2020-02-10 20:46:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:30,350 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7018 transitions. [2020-02-10 20:46:30,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7018 transitions. [2020-02-10 20:46:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:30,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:30,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] [2020-02-10 20:46:30,353 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1993951784, now seen corresponding path program 421 times [2020-02-10 20:46:30,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:30,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060957865] [2020-02-10 20:46:30,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:30,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060957865] [2020-02-10 20:46:30,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:30,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:30,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292553318] [2020-02-10 20:46:30,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:30,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:30,871 INFO L87 Difference]: Start difference. First operand 1563 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:46:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:31,081 INFO L93 Difference]: Finished difference Result 2894 states and 11583 transitions. [2020-02-10 20:46:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:31,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:31,089 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:46:31,089 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:46:31,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:46:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 20:46:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:46:31,156 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:46:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:31,156 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:46:31,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:46:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:31,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:31,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:31,158 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2127767820, now seen corresponding path program 422 times [2020-02-10 20:46:31,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:31,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146625121] [2020-02-10 20:46:31,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:31,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146625121] [2020-02-10 20:46:31,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:31,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:31,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543982049] [2020-02-10 20:46:31,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:31,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:31,688 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:46:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:31,885 INFO L93 Difference]: Finished difference Result 2893 states and 11577 transitions. [2020-02-10 20:46:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:31,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:31,893 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:46:31,893 INFO L226 Difference]: Without dead ends: 2875 [2020-02-10 20:46:31,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2020-02-10 20:46:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1567. [2020-02-10 20:46:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:46:31,959 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:46:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:31,959 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:46:31,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:46:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:31,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:31,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] [2020-02-10 20:46:31,961 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 920866404, now seen corresponding path program 423 times [2020-02-10 20:46:31,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:31,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843432408] [2020-02-10 20:46:31,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:32,483 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:46:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:32,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843432408] [2020-02-10 20:46:32,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:32,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:32,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442172424] [2020-02-10 20:46:32,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:32,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:32,491 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:46:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:32,684 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 20:46:32,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:32,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:32,691 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:46:32,691 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:46:32,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:46:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1572. [2020-02-10 20:46:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:46:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7038 transitions. [2020-02-10 20:46:32,759 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7038 transitions. Word has length 28 [2020-02-10 20:46:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:32,759 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7038 transitions. [2020-02-10 20:46:32,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7038 transitions. [2020-02-10 20:46:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:32,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:32,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] [2020-02-10 20:46:32,762 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1711448204, now seen corresponding path program 424 times [2020-02-10 20:46:32,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:32,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877828575] [2020-02-10 20:46:32,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:33,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877828575] [2020-02-10 20:46:33,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:33,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:33,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516420379] [2020-02-10 20:46:33,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:33,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:33,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:33,282 INFO L87 Difference]: Start difference. First operand 1572 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:46:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:33,489 INFO L93 Difference]: Finished difference Result 2900 states and 11587 transitions. [2020-02-10 20:46:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:33,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:33,497 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:46:33,497 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:46:33,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:46:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 20:46:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:46:33,562 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:46:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:33,562 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:46:33,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:46:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:33,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:33,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] [2020-02-10 20:46:33,565 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2125142044, now seen corresponding path program 425 times [2020-02-10 20:46:33,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:33,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594302168] [2020-02-10 20:46:33,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:34,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594302168] [2020-02-10 20:46:34,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:34,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:34,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437941060] [2020-02-10 20:46:34,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:34,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:34,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:34,101 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:46:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:34,332 INFO L93 Difference]: Finished difference Result 2895 states and 11577 transitions. [2020-02-10 20:46:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:34,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:34,340 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 20:46:34,340 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:46:34,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:46:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1571. [2020-02-10 20:46:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:46:34,407 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:46:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:34,407 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:46:34,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:46:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:34,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:34,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] [2020-02-10 20:46:34,410 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -635737048, now seen corresponding path program 426 times [2020-02-10 20:46:34,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:34,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783343571] [2020-02-10 20:46:34,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:34,950 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:34,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783343571] [2020-02-10 20:46:34,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:34,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:34,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982964878] [2020-02-10 20:46:34,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:34,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:34,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:34,958 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:46:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:35,166 INFO L93 Difference]: Finished difference Result 2898 states and 11579 transitions. [2020-02-10 20:46:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:35,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:35,174 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:46:35,174 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:46:35,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:46:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1563. [2020-02-10 20:46:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:46:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 20:46:35,241 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 20:46:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:35,242 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 20:46:35,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 20:46:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:35,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:35,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:35,244 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:35,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1545809910, now seen corresponding path program 427 times [2020-02-10 20:46:35,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:35,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496609776] [2020-02-10 20:46:35,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:35,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 20:46:35,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496609776] [2020-02-10 20:46:35,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:35,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:35,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715304779] [2020-02-10 20:46:35,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:35,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:35,773 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:46:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:35,962 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 20:46:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:35,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:35,970 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:46:35,970 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:46:35,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:46:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1571. [2020-02-10 20:46:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:46:36,037 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:46:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:36,037 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:46:36,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:46:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:36,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:36,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:36,039 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2117264716, now seen corresponding path program 428 times [2020-02-10 20:46:36,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:36,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546583351] [2020-02-10 20:46:36,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:36,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546583351] [2020-02-10 20:46:36,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:36,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:36,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381603048] [2020-02-10 20:46:36,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:36,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:36,563 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:46:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:36,781 INFO L93 Difference]: Finished difference Result 2896 states and 11580 transitions. [2020-02-10 20:46:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:36,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:36,789 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:46:36,789 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:46:36,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:46:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 20:46:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:46:36,855 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:46:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:36,855 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:46:36,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:46:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:36,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:36,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] [2020-02-10 20:46:36,857 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1676072006, now seen corresponding path program 429 times [2020-02-10 20:46:36,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:36,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487598826] [2020-02-10 20:46:36,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:37,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487598826] [2020-02-10 20:46:37,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:37,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:37,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306806713] [2020-02-10 20:46:37,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:37,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:37,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:37,382 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:46:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:37,578 INFO L93 Difference]: Finished difference Result 2903 states and 11596 transitions. [2020-02-10 20:46:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:37,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:37,586 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:46:37,586 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 20:46:37,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 20:46:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1573. [2020-02-10 20:46:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:46:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 20:46:37,652 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 20:46:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:37,652 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 20:46:37,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 20:46:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:37,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:37,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] [2020-02-10 20:46:37,655 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1700945100, now seen corresponding path program 430 times [2020-02-10 20:46:37,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:37,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453778744] [2020-02-10 20:46:37,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:38,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453778744] [2020-02-10 20:46:38,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:38,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:38,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242084914] [2020-02-10 20:46:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:38,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:38,202 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:46:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:38,389 INFO L93 Difference]: Finished difference Result 2904 states and 11592 transitions. [2020-02-10 20:46:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:38,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:38,396 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:46:38,396 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:46:38,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:46:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 20:46:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:46:38,462 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:46:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:38,462 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:46:38,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:46:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:38,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:38,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:38,465 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 569387398, now seen corresponding path program 431 times [2020-02-10 20:46:38,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:38,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050560664] [2020-02-10 20:46:38,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:38,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050560664] [2020-02-10 20:46:38,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:38,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:38,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023631724] [2020-02-10 20:46:38,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:38,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:38,991 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:46:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:39,178 INFO L93 Difference]: Finished difference Result 2897 states and 11578 transitions. [2020-02-10 20:46:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:39,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:39,185 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:46:39,185 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:46:39,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:46:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1571. [2020-02-10 20:46:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 20:46:39,251 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 20:46:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:39,251 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 20:46:39,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 20:46:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:39,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:39,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:39,253 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2058792394, now seen corresponding path program 432 times [2020-02-10 20:46:39,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:39,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945882309] [2020-02-10 20:46:39,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:39,783 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:39,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945882309] [2020-02-10 20:46:39,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:39,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:39,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211549114] [2020-02-10 20:46:39,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:39,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:39,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:39,791 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:46:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:40,013 INFO L93 Difference]: Finished difference Result 2900 states and 11580 transitions. [2020-02-10 20:46:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:40,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:40,020 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:46:40,020 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 20:46:40,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 20:46:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1559. [2020-02-10 20:46:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:46:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7003 transitions. [2020-02-10 20:46:40,086 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7003 transitions. Word has length 28 [2020-02-10 20:46:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:40,086 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7003 transitions. [2020-02-10 20:46:40,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7003 transitions. [2020-02-10 20:46:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:40,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:40,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:40,089 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 425451744, now seen corresponding path program 433 times [2020-02-10 20:46:40,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:40,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838924614] [2020-02-10 20:46:40,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:40,616 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:40,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838924614] [2020-02-10 20:46:40,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:40,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:40,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82566587] [2020-02-10 20:46:40,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:40,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:40,624 INFO L87 Difference]: Start difference. First operand 1559 states and 7003 transitions. Second operand 11 states. [2020-02-10 20:46:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:40,822 INFO L93 Difference]: Finished difference Result 2903 states and 11607 transitions. [2020-02-10 20:46:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:40,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:40,830 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:46:40,831 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:46:40,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:46:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1572. [2020-02-10 20:46:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:46:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 20:46:40,898 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 20:46:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:40,898 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 20:46:40,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 20:46:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:40,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:40,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:40,900 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:40,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1635408058, now seen corresponding path program 434 times [2020-02-10 20:46:40,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:40,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826433503] [2020-02-10 20:46:40,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:41,422 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:41,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826433503] [2020-02-10 20:46:41,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:41,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:41,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941276713] [2020-02-10 20:46:41,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:41,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:41,430 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:46:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:41,602 INFO L93 Difference]: Finished difference Result 2906 states and 11608 transitions. [2020-02-10 20:46:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:41,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:41,610 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:46:41,610 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:46:41,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:46:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1567. [2020-02-10 20:46:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 20:46:41,676 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 20:46:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:41,676 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 20:46:41,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 20:46:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:41,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:41,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:41,679 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash 963307322, now seen corresponding path program 435 times [2020-02-10 20:46:41,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:41,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913510379] [2020-02-10 20:46:41,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:42,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913510379] [2020-02-10 20:46:42,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:42,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:42,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864972786] [2020-02-10 20:46:42,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:42,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:42,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:42,215 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:46:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:42,425 INFO L93 Difference]: Finished difference Result 2898 states and 11592 transitions. [2020-02-10 20:46:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:42,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:42,432 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:46:42,433 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:46:42,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:46:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1571. [2020-02-10 20:46:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 20:46:42,499 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 20:46:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:42,499 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 20:46:42,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 20:46:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:42,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:42,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:42,502 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1136555014, now seen corresponding path program 436 times [2020-02-10 20:46:42,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:42,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614863466] [2020-02-10 20:46:42,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:43,034 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:46:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:43,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614863466] [2020-02-10 20:46:43,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:43,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:43,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885106292] [2020-02-10 20:46:43,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:43,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:43,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:43,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:43,042 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:46:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:43,237 INFO L93 Difference]: Finished difference Result 2897 states and 11586 transitions. [2020-02-10 20:46:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:43,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:43,245 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:46:43,245 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:46:43,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:46:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1567. [2020-02-10 20:46:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:46:43,311 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:46:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:43,311 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:46:43,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:46:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:43,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:43,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:43,314 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash -559696902, now seen corresponding path program 437 times [2020-02-10 20:46:43,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:43,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649159585] [2020-02-10 20:46:43,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:43,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649159585] [2020-02-10 20:46:43,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:43,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:43,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415644232] [2020-02-10 20:46:43,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:43,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:43,812 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:46:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:44,005 INFO L93 Difference]: Finished difference Result 2904 states and 11600 transitions. [2020-02-10 20:46:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:44,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:44,013 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:46:44,013 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:46:44,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:46:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1571. [2020-02-10 20:46:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:46:44,080 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:46:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:44,080 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:46:44,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:46:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:44,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:44,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:44,082 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1674410592, now seen corresponding path program 438 times [2020-02-10 20:46:44,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:44,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721589533] [2020-02-10 20:46:44,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:44,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721589533] [2020-02-10 20:46:44,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:44,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:44,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215924237] [2020-02-10 20:46:44,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:44,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:44,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:44,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:44,586 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:46:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:44,768 INFO L93 Difference]: Finished difference Result 2900 states and 11588 transitions. [2020-02-10 20:46:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:44,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:44,776 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 20:46:44,776 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:46:44,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:46:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1563. [2020-02-10 20:46:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:46:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7018 transitions. [2020-02-10 20:46:44,842 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7018 transitions. Word has length 28 [2020-02-10 20:46:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:44,842 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7018 transitions. [2020-02-10 20:46:44,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7018 transitions. [2020-02-10 20:46:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:44,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:44,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:44,845 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1519543332, now seen corresponding path program 439 times [2020-02-10 20:46:44,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:44,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205831318] [2020-02-10 20:46:44,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:45,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205831318] [2020-02-10 20:46:45,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:45,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:45,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446509199] [2020-02-10 20:46:45,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:45,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:45,370 INFO L87 Difference]: Start difference. First operand 1563 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:46:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:45,554 INFO L93 Difference]: Finished difference Result 2911 states and 11625 transitions. [2020-02-10 20:46:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:45,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:45,561 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 20:46:45,561 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:46:45,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:46:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1573. [2020-02-10 20:46:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:46:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 20:46:45,628 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 20:46:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:45,628 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 20:46:45,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 20:46:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:45,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:45,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:45,630 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash -541316470, now seen corresponding path program 440 times [2020-02-10 20:46:45,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:45,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281971477] [2020-02-10 20:46:45,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:46,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281971477] [2020-02-10 20:46:46,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:46,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:46,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98677278] [2020-02-10 20:46:46,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:46,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:46,164 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:46:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:46,341 INFO L93 Difference]: Finished difference Result 2914 states and 11626 transitions. [2020-02-10 20:46:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:46,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:46,350 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:46:46,351 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 20:46:46,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 20:46:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1568. [2020-02-10 20:46:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:46:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7032 transitions. [2020-02-10 20:46:46,423 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7032 transitions. Word has length 28 [2020-02-10 20:46:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:46,424 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7032 transitions. [2020-02-10 20:46:46,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7032 transitions. [2020-02-10 20:46:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:46,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:46,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:46,449 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 984313530, now seen corresponding path program 441 times [2020-02-10 20:46:46,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:46,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226049850] [2020-02-10 20:46:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:46,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226049850] [2020-02-10 20:46:46,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:46,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:46,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502763100] [2020-02-10 20:46:46,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:46,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:46,967 INFO L87 Difference]: Start difference. First operand 1568 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:46:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:47,143 INFO L93 Difference]: Finished difference Result 2910 states and 11618 transitions. [2020-02-10 20:46:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:47,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:47,150 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:46:47,151 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:46:47,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:46:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1573. [2020-02-10 20:46:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:46:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 20:46:47,218 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 20:46:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:47,219 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 20:46:47,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 20:46:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:47,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:47,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:47,221 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1648001078, now seen corresponding path program 442 times [2020-02-10 20:46:47,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:47,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953859017] [2020-02-10 20:46:47,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:47,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953859017] [2020-02-10 20:46:47,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:47,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:47,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016863987] [2020-02-10 20:46:47,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:47,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:47,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:47,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:47,739 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:46:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:47,922 INFO L93 Difference]: Finished difference Result 2912 states and 11617 transitions. [2020-02-10 20:46:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:47,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:47,929 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:46:47,929 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:46:47,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:46:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1568. [2020-02-10 20:46:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:46:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7027 transitions. [2020-02-10 20:46:47,997 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7027 transitions. Word has length 28 [2020-02-10 20:46:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:47,997 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7027 transitions. [2020-02-10 20:46:47,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7027 transitions. [2020-02-10 20:46:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:48,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:48,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:48,000 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:48,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash -538690694, now seen corresponding path program 443 times [2020-02-10 20:46:48,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:48,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047899852] [2020-02-10 20:46:48,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:48,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 20:46:48,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047899852] [2020-02-10 20:46:48,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:48,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:48,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431715342] [2020-02-10 20:46:48,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:48,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:48,514 INFO L87 Difference]: Start difference. First operand 1568 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:46:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:48,683 INFO L93 Difference]: Finished difference Result 2918 states and 11631 transitions. [2020-02-10 20:46:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:48,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:48,690 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:46:48,691 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:46:48,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:46:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1575. [2020-02-10 20:46:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:46:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7040 transitions. [2020-02-10 20:46:48,757 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7040 transitions. Word has length 28 [2020-02-10 20:46:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:48,757 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7040 transitions. [2020-02-10 20:46:48,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7040 transitions. [2020-02-10 20:46:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:48,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46: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] [2020-02-10 20:46:48,759 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1110145500, now seen corresponding path program 444 times [2020-02-10 20:46:48,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:48,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489957008] [2020-02-10 20:46:48,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:49,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489957008] [2020-02-10 20:46:49,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:49,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:49,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812833649] [2020-02-10 20:46:49,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:49,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:49,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:49,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:49,288 INFO L87 Difference]: Start difference. First operand 1575 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:46:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:49,463 INFO L93 Difference]: Finished difference Result 2917 states and 11622 transitions. [2020-02-10 20:46:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:49,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:49,471 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:46:49,471 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:46:49,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:49,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:46:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1563. [2020-02-10 20:46:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:46:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 20:46:49,539 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 20:46:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:49,539 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 20:46:49,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:49,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 20:46:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:49,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:49,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:49,542 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:49,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1551052644, now seen corresponding path program 445 times [2020-02-10 20:46:49,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:49,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465914073] [2020-02-10 20:46:49,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:50,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465914073] [2020-02-10 20:46:50,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:50,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:50,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757444361] [2020-02-10 20:46:50,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:50,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:50,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:50,066 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:46:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:50,268 INFO L93 Difference]: Finished difference Result 2897 states and 11586 transitions. [2020-02-10 20:46:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:50,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:50,275 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:46:50,276 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:46:50,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:46:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1571. [2020-02-10 20:46:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:46:50,342 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:46:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:50,342 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:46:50,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:46:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:50,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:50,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] [2020-02-10 20:46:50,344 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1724300336, now seen corresponding path program 446 times [2020-02-10 20:46:50,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:50,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48773747] [2020-02-10 20:46:50,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:50,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48773747] [2020-02-10 20:46:50,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:50,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:50,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243028470] [2020-02-10 20:46:50,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:50,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:50,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:50,874 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:46:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:51,077 INFO L93 Difference]: Finished difference Result 2896 states and 11580 transitions. [2020-02-10 20:46:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:51,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:51,085 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 20:46:51,085 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 20:46:51,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 20:46:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 20:46:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:46:51,153 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:46:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:51,153 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:46:51,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:46:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:51,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:51,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:51,156 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:51,156 INFO L82 PathProgramCache]: Analyzing trace with hash 477967264, now seen corresponding path program 447 times [2020-02-10 20:46:51,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:51,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421700212] [2020-02-10 20:46:51,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:51,677 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:46:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:51,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421700212] [2020-02-10 20:46:51,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:51,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:51,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640835618] [2020-02-10 20:46:51,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:51,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:51,685 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:46:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:51,903 INFO L93 Difference]: Finished difference Result 2901 states and 11591 transitions. [2020-02-10 20:46:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:51,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:51,911 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:46:51,911 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:46:51,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:46:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1572. [2020-02-10 20:46:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:46:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7034 transitions. [2020-02-10 20:46:51,977 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7034 transitions. Word has length 28 [2020-02-10 20:46:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:51,977 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7034 transitions. [2020-02-10 20:46:51,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7034 transitions. [2020-02-10 20:46:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:51,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:51,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] [2020-02-10 20:46:51,980 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2140619952, now seen corresponding path program 448 times [2020-02-10 20:46:51,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:51,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191858200] [2020-02-10 20:46:51,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:52,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191858200] [2020-02-10 20:46:52,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:52,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:52,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414081848] [2020-02-10 20:46:52,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:52,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:52,523 INFO L87 Difference]: Start difference. First operand 1572 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:46:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:52,712 INFO L93 Difference]: Finished difference Result 2903 states and 11590 transitions. [2020-02-10 20:46:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:52,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:52,720 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:46:52,720 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:46:52,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:46:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 20:46:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:46:52,785 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:46:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:52,785 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:46:52,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:46:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:52,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:52,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:52,788 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1726926112, now seen corresponding path program 449 times [2020-02-10 20:46:52,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:52,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670176394] [2020-02-10 20:46:52,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:53,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670176394] [2020-02-10 20:46:53,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:53,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:53,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55140959] [2020-02-10 20:46:53,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:53,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:53,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:53,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:53,294 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:46:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:53,491 INFO L93 Difference]: Finished difference Result 2898 states and 11580 transitions. [2020-02-10 20:46:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:53,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:53,498 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 20:46:53,498 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:46:53,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:46:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 20:46:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 20:46:53,564 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 20:46:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:53,564 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 20:46:53,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 20:46:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:53,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:53,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:53,567 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1078636188, now seen corresponding path program 450 times [2020-02-10 20:46:53,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:53,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17306473] [2020-02-10 20:46:53,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:54,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17306473] [2020-02-10 20:46:54,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:54,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:54,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717004526] [2020-02-10 20:46:54,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:54,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:54,090 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:46:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:54,296 INFO L93 Difference]: Finished difference Result 2901 states and 11582 transitions. [2020-02-10 20:46:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:54,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:54,304 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:46:54,305 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 20:46:54,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 20:46:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1563. [2020-02-10 20:46:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:46:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 20:46:54,370 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 20:46:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:54,370 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 20:46:54,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 20:46:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:54,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:54,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:54,373 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:54,373 INFO L82 PathProgramCache]: Analyzing trace with hash -478297846, now seen corresponding path program 451 times [2020-02-10 20:46:54,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:54,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923806998] [2020-02-10 20:46:54,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:54,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923806998] [2020-02-10 20:46:54,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:54,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:54,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209951527] [2020-02-10 20:46:54,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:54,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:54,876 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:46:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:55,055 INFO L93 Difference]: Finished difference Result 2908 states and 11606 transitions. [2020-02-10 20:46:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:55,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:55,062 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:46:55,062 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:46:55,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:46:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 20:46:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:46:55,128 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:46:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:55,128 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:46:55,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:46:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:55,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:55,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:55,131 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1755809648, now seen corresponding path program 452 times [2020-02-10 20:46:55,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:55,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83977580] [2020-02-10 20:46:55,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:55,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83977580] [2020-02-10 20:46:55,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:55,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:55,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621096336] [2020-02-10 20:46:55,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:55,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:55,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:55,651 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:46:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:55,833 INFO L93 Difference]: Finished difference Result 2904 states and 11594 transitions. [2020-02-10 20:46:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:55,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:55,841 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:46:55,841 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:46:55,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:46:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1567. [2020-02-10 20:46:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:46:55,909 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:46:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:55,909 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:46:55,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:46:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:55,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:55,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] [2020-02-10 20:46:55,911 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1551383226, now seen corresponding path program 453 times [2020-02-10 20:46:55,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:55,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295493650] [2020-02-10 20:46:55,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:56,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295493650] [2020-02-10 20:46:56,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:56,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:56,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975470773] [2020-02-10 20:46:56,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:56,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:56,446 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:46:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:56,656 INFO L93 Difference]: Finished difference Result 2914 states and 11617 transitions. [2020-02-10 20:46:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:56,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:56,663 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:46:56,664 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:46:56,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:46:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1574. [2020-02-10 20:46:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:46:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7034 transitions. [2020-02-10 20:46:56,730 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7034 transitions. Word has length 28 [2020-02-10 20:46:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:56,730 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7034 transitions. [2020-02-10 20:46:56,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7034 transitions. [2020-02-10 20:46:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:56,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:56,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:56,732 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2122838032, now seen corresponding path program 454 times [2020-02-10 20:46:56,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:56,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645259065] [2020-02-10 20:46:56,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:57,260 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:57,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645259065] [2020-02-10 20:46:57,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:57,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:57,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043448092] [2020-02-10 20:46:57,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:57,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:57,267 INFO L87 Difference]: Start difference. First operand 1574 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:46:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:57,464 INFO L93 Difference]: Finished difference Result 2913 states and 11608 transitions. [2020-02-10 20:46:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:57,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:57,472 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:46:57,473 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:46:57,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:46:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1567. [2020-02-10 20:46:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:46:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 20:46:57,538 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 20:46:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:57,539 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 20:46:57,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 20:46:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:57,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:57,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] [2020-02-10 20:46:57,541 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1220579846, now seen corresponding path program 455 times [2020-02-10 20:46:57,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:57,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153976319] [2020-02-10 20:46:57,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:58,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153976319] [2020-02-10 20:46:58,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:58,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:58,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744983059] [2020-02-10 20:46:58,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:58,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:58,072 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:46:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:58,316 INFO L93 Difference]: Finished difference Result 2903 states and 11588 transitions. [2020-02-10 20:46:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:58,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:58,324 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:46:58,324 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:46:58,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:46:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1571. [2020-02-10 20:46:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:46:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7024 transitions. [2020-02-10 20:46:58,390 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7024 transitions. Word has length 28 [2020-02-10 20:46:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:58,390 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7024 transitions. [2020-02-10 20:46:58,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7024 transitions. [2020-02-10 20:46:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:58,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:58,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] [2020-02-10 20:46:58,393 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1584982454, now seen corresponding path program 456 times [2020-02-10 20:46:58,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:58,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797152812] [2020-02-10 20:46:58,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:58,917 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:46:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:58,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797152812] [2020-02-10 20:46:58,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:58,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:58,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278387020] [2020-02-10 20:46:58,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:58,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:58,925 INFO L87 Difference]: Start difference. First operand 1571 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:46:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:59,143 INFO L93 Difference]: Finished difference Result 2906 states and 11590 transitions. [2020-02-10 20:46:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:59,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:59,151 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:46:59,151 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:46:59,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:46:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1559. [2020-02-10 20:46:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 20:46:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 6999 transitions. [2020-02-10 20:46:59,217 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 6999 transitions. Word has length 28 [2020-02-10 20:46:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:59,217 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 6999 transitions. [2020-02-10 20:46:59,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:46:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 6999 transitions. [2020-02-10 20:46:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:46:59,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:59,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] [2020-02-10 20:46:59,220 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:46:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1188275872, now seen corresponding path program 457 times [2020-02-10 20:46:59,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:59,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787222551] [2020-02-10 20:46:59,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:59,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787222551] [2020-02-10 20:46:59,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:59,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:46:59,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799501257] [2020-02-10 20:46:59,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:46:59,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:46:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:59,736 INFO L87 Difference]: Start difference. First operand 1559 states and 6999 transitions. Second operand 11 states. [2020-02-10 20:46:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:59,945 INFO L93 Difference]: Finished difference Result 2912 states and 11627 transitions. [2020-02-10 20:46:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:46:59,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:46:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:59,952 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:46:59,953 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:46:59,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:46:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:47:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1573. [2020-02-10 20:47:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:47:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:47:00,019 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:47:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:00,019 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:47:00,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:47:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:00,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:00,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:00,022 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:00,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 301129124, now seen corresponding path program 458 times [2020-02-10 20:47:00,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:00,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27605278] [2020-02-10 20:47:00,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:00,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27605278] [2020-02-10 20:47:00,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:00,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:00,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457784722] [2020-02-10 20:47:00,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:00,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:00,546 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:47:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:00,725 INFO L93 Difference]: Finished difference Result 2914 states and 11625 transitions. [2020-02-10 20:47:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:00,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:00,733 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:47:00,733 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:47:00,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:47:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1567. [2020-02-10 20:47:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:47:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 20:47:00,800 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 20:47:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:00,800 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 20:47:00,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 20:47:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:00,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:00,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:00,802 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash -650420294, now seen corresponding path program 459 times [2020-02-10 20:47:00,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:00,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797875282] [2020-02-10 20:47:00,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:01,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797875282] [2020-02-10 20:47:01,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:01,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:01,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352941338] [2020-02-10 20:47:01,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:01,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:01,326 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:47:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:01,533 INFO L93 Difference]: Finished difference Result 2906 states and 11609 transitions. [2020-02-10 20:47:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:01,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:01,540 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:47:01,540 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:47:01,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:47:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 20:47:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:47:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:47:01,606 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:47:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:01,606 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:47:01,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:47:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:01,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:01,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:01,609 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1221875100, now seen corresponding path program 460 times [2020-02-10 20:47:01,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:01,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339070410] [2020-02-10 20:47:01,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:02,125 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:47:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:02,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339070410] [2020-02-10 20:47:02,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:02,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:02,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824608340] [2020-02-10 20:47:02,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:02,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:02,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:02,133 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:47:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:02,357 INFO L93 Difference]: Finished difference Result 2904 states and 11601 transitions. [2020-02-10 20:47:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:02,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:02,364 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:47:02,364 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 20:47:02,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 20:47:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1567. [2020-02-10 20:47:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:47:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:47:02,430 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:47:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:02,430 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:47:02,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:47:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:02,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:02,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:02,432 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -234100678, now seen corresponding path program 461 times [2020-02-10 20:47:02,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:02,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864881173] [2020-02-10 20:47:02,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:02,953 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:47:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:02,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864881173] [2020-02-10 20:47:02,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:02,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:02,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943824966] [2020-02-10 20:47:02,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:02,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:02,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:02,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:02,961 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:47:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:03,164 INFO L93 Difference]: Finished difference Result 2910 states and 11613 transitions. [2020-02-10 20:47:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:03,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:03,172 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:47:03,172 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:47:03,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:47:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1571. [2020-02-10 20:47:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:47:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:47:03,238 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:47:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:03,238 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:47:03,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:47:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:03,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:03,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:03,241 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2000006816, now seen corresponding path program 462 times [2020-02-10 20:47:03,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:03,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141814157] [2020-02-10 20:47:03,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:03,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141814157] [2020-02-10 20:47:03,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:03,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:03,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200424749] [2020-02-10 20:47:03,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:03,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:03,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:03,772 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:47:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:03,968 INFO L93 Difference]: Finished difference Result 2906 states and 11601 transitions. [2020-02-10 20:47:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:03,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:03,975 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 20:47:03,975 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 20:47:03,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 20:47:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1563. [2020-02-10 20:47:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:47:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 20:47:04,069 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 20:47:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:04,069 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 20:47:04,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 20:47:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:04,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:04,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] [2020-02-10 20:47:04,072 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash -94184284, now seen corresponding path program 463 times [2020-02-10 20:47:04,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:04,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425575897] [2020-02-10 20:47:04,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:04,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425575897] [2020-02-10 20:47:04,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:04,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:04,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460135124] [2020-02-10 20:47:04,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:04,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:04,605 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:47:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:04,814 INFO L93 Difference]: Finished difference Result 2922 states and 11652 transitions. [2020-02-10 20:47:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:04,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:04,821 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:47:04,821 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 20:47:04,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 20:47:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1575. [2020-02-10 20:47:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:47:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 20:47:04,887 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 20:47:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:04,887 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 20:47:04,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 20:47:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:04,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:04,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:04,890 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1395220712, now seen corresponding path program 464 times [2020-02-10 20:47:04,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:04,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427998914] [2020-02-10 20:47:04,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:05,409 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:47:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:05,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427998914] [2020-02-10 20:47:05,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:05,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:05,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814293443] [2020-02-10 20:47:05,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:05,417 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:47:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:05,595 INFO L93 Difference]: Finished difference Result 2924 states and 11650 transitions. [2020-02-10 20:47:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:05,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:05,603 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 20:47:05,603 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:47:05,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:47:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1569. [2020-02-10 20:47:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:47:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7031 transitions. [2020-02-10 20:47:05,669 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7031 transitions. Word has length 28 [2020-02-10 20:47:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:05,669 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7031 transitions. [2020-02-10 20:47:05,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7031 transitions. [2020-02-10 20:47:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:05,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:05,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:05,672 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -629414086, now seen corresponding path program 465 times [2020-02-10 20:47:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:05,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741303484] [2020-02-10 20:47:05,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:06,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741303484] [2020-02-10 20:47:06,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:06,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:06,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976799141] [2020-02-10 20:47:06,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:06,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:06,195 INFO L87 Difference]: Start difference. First operand 1569 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:47:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:06,458 INFO L93 Difference]: Finished difference Result 2921 states and 11644 transitions. [2020-02-10 20:47:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:06,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:06,466 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 20:47:06,466 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:47:06,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:47:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1575. [2020-02-10 20:47:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:47:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7042 transitions. [2020-02-10 20:47:06,533 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7042 transitions. Word has length 28 [2020-02-10 20:47:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:06,533 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7042 transitions. [2020-02-10 20:47:06,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7042 transitions. [2020-02-10 20:47:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:06,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:06,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:06,535 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash 288536104, now seen corresponding path program 466 times [2020-02-10 20:47:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:06,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53619799] [2020-02-10 20:47:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:07,069 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:07,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53619799] [2020-02-10 20:47:07,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:07,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:07,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32923998] [2020-02-10 20:47:07,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:07,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:07,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:07,077 INFO L87 Difference]: Start difference. First operand 1575 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:47:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:07,294 INFO L93 Difference]: Finished difference Result 2922 states and 11640 transitions. [2020-02-10 20:47:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:07,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:07,301 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:47:07,301 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:47:07,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:47:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 20:47:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:47:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7025 transitions. [2020-02-10 20:47:07,370 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7025 transitions. Word has length 28 [2020-02-10 20:47:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:07,370 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7025 transitions. [2020-02-10 20:47:07,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7025 transitions. [2020-02-10 20:47:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:07,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:07,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] [2020-02-10 20:47:07,372 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:07,373 INFO L82 PathProgramCache]: Analyzing trace with hash -213094470, now seen corresponding path program 467 times [2020-02-10 20:47:07,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:07,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26821710] [2020-02-10 20:47:07,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:07,900 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:47:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:07,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26821710] [2020-02-10 20:47:07,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:07,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:07,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124092622] [2020-02-10 20:47:07,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:07,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:07,908 INFO L87 Difference]: Start difference. First operand 1569 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:47:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:08,170 INFO L93 Difference]: Finished difference Result 2926 states and 11649 transitions. [2020-02-10 20:47:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:08,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:08,178 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 20:47:08,178 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 20:47:08,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 20:47:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1576. [2020-02-10 20:47:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:47:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7038 transitions. [2020-02-10 20:47:08,245 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7038 transitions. Word has length 28 [2020-02-10 20:47:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:08,245 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7038 transitions. [2020-02-10 20:47:08,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7038 transitions. [2020-02-10 20:47:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:08,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:08,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] [2020-02-10 20:47:08,248 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash -784549276, now seen corresponding path program 468 times [2020-02-10 20:47:08,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:08,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909712969] [2020-02-10 20:47:08,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:08,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909712969] [2020-02-10 20:47:08,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:08,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:08,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926904092] [2020-02-10 20:47:08,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:08,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:08,782 INFO L87 Difference]: Start difference. First operand 1576 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:47:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:09,004 INFO L93 Difference]: Finished difference Result 2925 states and 11640 transitions. [2020-02-10 20:47:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:09,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:09,012 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:47:09,012 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 20:47:09,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 20:47:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1563. [2020-02-10 20:47:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:47:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 20:47:09,080 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 20:47:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:09,080 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 20:47:09,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 20:47:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:09,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:09,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:09,082 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash -62674972, now seen corresponding path program 469 times [2020-02-10 20:47:09,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:09,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138639615] [2020-02-10 20:47:09,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:09,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138639615] [2020-02-10 20:47:09,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:09,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609132659] [2020-02-10 20:47:09,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:09,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:09,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:09,603 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:47:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:09,819 INFO L93 Difference]: Finished difference Result 2905 states and 11603 transitions. [2020-02-10 20:47:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:09,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:09,827 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 20:47:09,827 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 20:47:09,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 20:47:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1571. [2020-02-10 20:47:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:47:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 20:47:09,893 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 20:47:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:09,893 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 20:47:09,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 20:47:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:09,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:09,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:09,895 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash -634129778, now seen corresponding path program 470 times [2020-02-10 20:47:09,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:09,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381749812] [2020-02-10 20:47:09,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:10,431 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:10,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381749812] [2020-02-10 20:47:10,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:10,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:10,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763029396] [2020-02-10 20:47:10,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:10,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:10,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:10,439 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:47:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:10,643 INFO L93 Difference]: Finished difference Result 2903 states and 11595 transitions. [2020-02-10 20:47:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:10,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:10,650 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 20:47:10,650 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 20:47:10,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 20:47:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1567. [2020-02-10 20:47:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:47:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 20:47:10,715 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 20:47:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:10,715 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 20:47:10,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 20:47:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:10,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:10,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:10,718 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1135760352, now seen corresponding path program 471 times [2020-02-10 20:47:10,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:10,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2580311] [2020-02-10 20:47:10,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:11,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2580311] [2020-02-10 20:47:11,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:11,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:11,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057553221] [2020-02-10 20:47:11,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:11,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:11,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:11,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:11,257 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:47:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:11,450 INFO L93 Difference]: Finished difference Result 2910 states and 11611 transitions. [2020-02-10 20:47:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:11,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:11,457 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:47:11,458 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:47:11,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:47:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1573. [2020-02-10 20:47:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:47:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7032 transitions. [2020-02-10 20:47:11,526 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7032 transitions. Word has length 28 [2020-02-10 20:47:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:11,526 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7032 transitions. [2020-02-10 20:47:11,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7032 transitions. [2020-02-10 20:47:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:11,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:11,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:11,528 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:11,529 INFO L82 PathProgramCache]: Analyzing trace with hash -217810162, now seen corresponding path program 472 times [2020-02-10 20:47:11,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:11,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12489100] [2020-02-10 20:47:11,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:12,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12489100] [2020-02-10 20:47:12,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:12,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:12,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015955601] [2020-02-10 20:47:12,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:12,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:12,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:12,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:12,065 INFO L87 Difference]: Start difference. First operand 1573 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:47:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:12,331 INFO L93 Difference]: Finished difference Result 2911 states and 11607 transitions. [2020-02-10 20:47:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:12,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:12,339 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 20:47:12,340 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 20:47:12,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 20:47:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1567. [2020-02-10 20:47:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:47:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 20:47:12,406 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 20:47:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:12,406 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 20:47:12,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 20:47:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:12,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:12,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] [2020-02-10 20:47:12,408 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2052522336, now seen corresponding path program 473 times [2020-02-10 20:47:12,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:12,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587463150] [2020-02-10 20:47:12,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:12,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587463150] [2020-02-10 20:47:12,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:12,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:12,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045524544] [2020-02-10 20:47:12,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:12,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:12,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:12,936 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:47:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:13,131 INFO L93 Difference]: Finished difference Result 2904 states and 11593 transitions. [2020-02-10 20:47:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:13,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:13,138 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 20:47:13,138 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:47:13,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:47:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 20:47:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:47:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7024 transitions. [2020-02-10 20:47:13,205 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7024 transitions. Word has length 28 [2020-02-10 20:47:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:13,205 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7024 transitions. [2020-02-10 20:47:13,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7024 transitions. [2020-02-10 20:47:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:13,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:13,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] [2020-02-10 20:47:13,208 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -753039964, now seen corresponding path program 474 times [2020-02-10 20:47:13,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:13,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413440228] [2020-02-10 20:47:13,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:13,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413440228] [2020-02-10 20:47:13,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:13,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:13,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943350748] [2020-02-10 20:47:13,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:13,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:13,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:13,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:13,730 INFO L87 Difference]: Start difference. First operand 1571 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:47:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:13,996 INFO L93 Difference]: Finished difference Result 2907 states and 11595 transitions. [2020-02-10 20:47:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:13,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:14,004 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:47:14,004 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 20:47:14,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 20:47:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1563. [2020-02-10 20:47:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:47:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7006 transitions. [2020-02-10 20:47:14,070 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7006 transitions. Word has length 28 [2020-02-10 20:47:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:14,070 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7006 transitions. [2020-02-10 20:47:14,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7006 transitions. [2020-02-10 20:47:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:14,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:14,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:14,073 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1447736232, now seen corresponding path program 475 times [2020-02-10 20:47:14,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:14,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121669106] [2020-02-10 20:47:14,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:14,601 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:47:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:14,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121669106] [2020-02-10 20:47:14,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:14,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:14,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860836138] [2020-02-10 20:47:14,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:14,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:14,609 INFO L87 Difference]: Start difference. First operand 1563 states and 7006 transitions. Second operand 11 states. [2020-02-10 20:47:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:14,782 INFO L93 Difference]: Finished difference Result 2912 states and 11614 transitions. [2020-02-10 20:47:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:14,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:14,790 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:47:14,790 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:47:14,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:47:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1571. [2020-02-10 20:47:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:47:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 20:47:14,856 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 20:47:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:14,856 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 20:47:14,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 20:47:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:14,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:14,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] [2020-02-10 20:47:14,859 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash -613123570, now seen corresponding path program 476 times [2020-02-10 20:47:14,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:14,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22085877] [2020-02-10 20:47:14,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:15,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22085877] [2020-02-10 20:47:15,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:15,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:15,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358404860] [2020-02-10 20:47:15,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:15,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:15,381 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:47:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:15,555 INFO L93 Difference]: Finished difference Result 2908 states and 11602 transitions. [2020-02-10 20:47:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:15,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:15,562 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:47:15,563 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:47:15,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:47:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1567. [2020-02-10 20:47:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:47:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 20:47:15,630 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 20:47:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:15,630 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 20:47:15,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 20:47:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:15,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:15,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:15,633 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 374650852, now seen corresponding path program 477 times [2020-02-10 20:47:15,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:15,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381449766] [2020-02-10 20:47:15,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:16,064 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-02-10 20:47:16,180 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:47:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:16,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381449766] [2020-02-10 20:47:16,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:16,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:16,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291879467] [2020-02-10 20:47:16,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:16,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:16,187 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:47:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:16,359 INFO L93 Difference]: Finished difference Result 2918 states and 11625 transitions. [2020-02-10 20:47:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:16,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:16,367 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:47:16,367 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:47:16,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:47:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1574. [2020-02-10 20:47:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:47:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 20:47:16,433 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 20:47:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:16,433 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 20:47:16,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 20:47:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:16,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:16,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] [2020-02-10 20:47:16,436 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:16,436 INFO L82 PathProgramCache]: Analyzing trace with hash -196803954, now seen corresponding path program 478 times [2020-02-10 20:47:16,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:16,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33347461] [2020-02-10 20:47:16,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:16,961 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:16,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33347461] [2020-02-10 20:47:16,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:16,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:16,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362777115] [2020-02-10 20:47:16,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:16,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:16,970 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:47:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:17,157 INFO L93 Difference]: Finished difference Result 2917 states and 11616 transitions. [2020-02-10 20:47:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:17,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:17,165 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:47:17,165 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:47:17,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:47:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1567. [2020-02-10 20:47:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:47:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7013 transitions. [2020-02-10 20:47:17,231 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7013 transitions. Word has length 28 [2020-02-10 20:47:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:17,231 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7013 transitions. [2020-02-10 20:47:17,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7013 transitions. [2020-02-10 20:47:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:17,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:17,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] [2020-02-10 20:47:17,234 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1148353372, now seen corresponding path program 479 times [2020-02-10 20:47:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:17,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49440560] [2020-02-10 20:47:17,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:17,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49440560] [2020-02-10 20:47:17,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:17,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:17,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435844815] [2020-02-10 20:47:17,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:17,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:17,759 INFO L87 Difference]: Start difference. First operand 1567 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:47:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:17,935 INFO L93 Difference]: Finished difference Result 2907 states and 11596 transitions. [2020-02-10 20:47:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:17,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:17,943 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 20:47:17,943 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:47:17,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:47:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1571. [2020-02-10 20:47:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:47:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7020 transitions. [2020-02-10 20:47:18,009 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7020 transitions. Word has length 28 [2020-02-10 20:47:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:18,009 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7020 transitions. [2020-02-10 20:47:18,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7020 transitions. [2020-02-10 20:47:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:18,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:18,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] [2020-02-10 20:47:18,012 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 341051624, now seen corresponding path program 480 times [2020-02-10 20:47:18,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:18,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529590250] [2020-02-10 20:47:18,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:18,549 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:18,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529590250] [2020-02-10 20:47:18,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:18,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:18,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635482791] [2020-02-10 20:47:18,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:18,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:18,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:18,558 INFO L87 Difference]: Start difference. First operand 1571 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:47:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:18,754 INFO L93 Difference]: Finished difference Result 2910 states and 11598 transitions. [2020-02-10 20:47:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:18,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:18,763 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 20:47:18,763 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:47:18,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:47:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1555. [2020-02-10 20:47:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:47:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6988 transitions. [2020-02-10 20:47:18,829 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6988 transitions. Word has length 28 [2020-02-10 20:47:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:18,829 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6988 transitions. [2020-02-10 20:47:18,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6988 transitions. [2020-02-10 20:47:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:18,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:18,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:18,833 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1827506600, now seen corresponding path program 481 times [2020-02-10 20:47:18,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:18,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291761349] [2020-02-10 20:47:18,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:19,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291761349] [2020-02-10 20:47:19,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:19,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:19,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488909910] [2020-02-10 20:47:19,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:19,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:19,374 INFO L87 Difference]: Start difference. First operand 1555 states and 6988 transitions. Second operand 11 states. [2020-02-10 20:47:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:19,559 INFO L93 Difference]: Finished difference Result 2973 states and 11790 transitions. [2020-02-10 20:47:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:19,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:19,567 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:47:19,568 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:47:19,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:47:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 20:47:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:47:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7084 transitions. [2020-02-10 20:47:19,634 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7084 transitions. Word has length 28 [2020-02-10 20:47:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:19,634 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7084 transitions. [2020-02-10 20:47:19,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7084 transitions. [2020-02-10 20:47:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:19,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:19,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:19,637 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:19,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash -978055700, now seen corresponding path program 482 times [2020-02-10 20:47:19,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:19,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148850026] [2020-02-10 20:47:19,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:20,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148850026] [2020-02-10 20:47:20,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:20,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:20,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071265390] [2020-02-10 20:47:20,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:20,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:20,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:20,185 INFO L87 Difference]: Start difference. First operand 1581 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:47:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:20,322 INFO L93 Difference]: Finished difference Result 2978 states and 11794 transitions. [2020-02-10 20:47:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:20,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:20,330 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:47:20,330 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:47:20,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:47:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1575. [2020-02-10 20:47:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:47:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7067 transitions. [2020-02-10 20:47:20,396 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7067 transitions. Word has length 28 [2020-02-10 20:47:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:20,397 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7067 transitions. [2020-02-10 20:47:20,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7067 transitions. [2020-02-10 20:47:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:20,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:20,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] [2020-02-10 20:47:20,399 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -856519738, now seen corresponding path program 483 times [2020-02-10 20:47:20,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:20,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102947031] [2020-02-10 20:47:20,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:20,923 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:20,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102947031] [2020-02-10 20:47:20,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:20,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:20,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130851858] [2020-02-10 20:47:20,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:20,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:20,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:20,931 INFO L87 Difference]: Start difference. First operand 1575 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:47:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:21,116 INFO L93 Difference]: Finished difference Result 2970 states and 11779 transitions. [2020-02-10 20:47:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:21,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:21,123 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:47:21,124 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:47:21,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:47:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1580. [2020-02-10 20:47:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:47:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7076 transitions. [2020-02-10 20:47:21,190 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7076 transitions. Word has length 28 [2020-02-10 20:47:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:21,190 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7076 transitions. [2020-02-10 20:47:21,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7076 transitions. [2020-02-10 20:47:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:21,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:21,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:21,193 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1377587756, now seen corresponding path program 484 times [2020-02-10 20:47:21,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:21,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145359167] [2020-02-10 20:47:21,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:21,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145359167] [2020-02-10 20:47:21,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:21,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:21,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087917646] [2020-02-10 20:47:21,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:21,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:21,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:21,736 INFO L87 Difference]: Start difference. First operand 1580 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:47:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:21,922 INFO L93 Difference]: Finished difference Result 2973 states and 11780 transitions. [2020-02-10 20:47:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:21,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:21,929 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:47:21,929 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:47:21,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:47:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1575. [2020-02-10 20:47:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:47:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7062 transitions. [2020-02-10 20:47:22,016 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7062 transitions. Word has length 28 [2020-02-10 20:47:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:22,016 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7062 transitions. [2020-02-10 20:47:22,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7062 transitions. [2020-02-10 20:47:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:22,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:22,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:22,019 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:22,019 INFO L82 PathProgramCache]: Analyzing trace with hash -440200122, now seen corresponding path program 485 times [2020-02-10 20:47:22,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:22,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243130417] [2020-02-10 20:47:22,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:22,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243130417] [2020-02-10 20:47:22,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:22,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:22,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803661333] [2020-02-10 20:47:22,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:22,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:22,551 INFO L87 Difference]: Start difference. First operand 1575 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:47:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:22,683 INFO L93 Difference]: Finished difference Result 2985 states and 11804 transitions. [2020-02-10 20:47:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:22,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:22,691 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:47:22,691 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:47:22,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:47:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1585. [2020-02-10 20:47:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:47:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7079 transitions. [2020-02-10 20:47:22,758 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7079 transitions. Word has length 28 [2020-02-10 20:47:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:22,758 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7079 transitions. [2020-02-10 20:47:22,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7079 transitions. [2020-02-10 20:47:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:22,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:22,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:22,760 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash 304502376, now seen corresponding path program 486 times [2020-02-10 20:47:22,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:22,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808164176] [2020-02-10 20:47:22,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:23,305 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:23,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808164176] [2020-02-10 20:47:23,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:23,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:23,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979271585] [2020-02-10 20:47:23,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:23,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:23,313 INFO L87 Difference]: Start difference. First operand 1585 states and 7079 transitions. Second operand 11 states. [2020-02-10 20:47:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:23,517 INFO L93 Difference]: Finished difference Result 2983 states and 11792 transitions. [2020-02-10 20:47:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:23,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:23,524 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:47:23,524 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:47:23,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:47:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1568. [2020-02-10 20:47:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:47:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 20:47:23,590 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 20:47:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:23,590 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 20:47:23,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 20:47:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:23,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:23,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] [2020-02-10 20:47:23,593 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1321160334, now seen corresponding path program 487 times [2020-02-10 20:47:23,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:23,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050040549] [2020-02-10 20:47:23,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:24,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050040549] [2020-02-10 20:47:24,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:24,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:24,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587459188] [2020-02-10 20:47:24,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:24,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:24,147 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:47:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:24,323 INFO L93 Difference]: Finished difference Result 2961 states and 11754 transitions. [2020-02-10 20:47:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:24,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:24,331 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:47:24,331 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:47:24,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:47:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1579. [2020-02-10 20:47:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:47:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7072 transitions. [2020-02-10 20:47:24,398 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7072 transitions. Word has length 28 [2020-02-10 20:47:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:24,398 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7072 transitions. [2020-02-10 20:47:24,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7072 transitions. [2020-02-10 20:47:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:24,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:24,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:24,401 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1484401966, now seen corresponding path program 488 times [2020-02-10 20:47:24,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:24,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070790154] [2020-02-10 20:47:24,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:24,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070790154] [2020-02-10 20:47:24,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:24,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:24,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569992252] [2020-02-10 20:47:24,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:24,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:24,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:24,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:24,946 INFO L87 Difference]: Start difference. First operand 1579 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:47:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:25,088 INFO L93 Difference]: Finished difference Result 2966 states and 11758 transitions. [2020-02-10 20:47:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:25,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:25,095 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:47:25,096 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:47:25,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:47:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1573. [2020-02-10 20:47:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:47:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7056 transitions. [2020-02-10 20:47:25,163 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7056 transitions. Word has length 28 [2020-02-10 20:47:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:25,163 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7056 transitions. [2020-02-10 20:47:25,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7056 transitions. [2020-02-10 20:47:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:25,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:25,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] [2020-02-10 20:47:25,165 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:25,165 INFO L82 PathProgramCache]: Analyzing trace with hash -825010426, now seen corresponding path program 489 times [2020-02-10 20:47:25,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:25,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834241214] [2020-02-10 20:47:25,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834241214] [2020-02-10 20:47:25,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:25,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:25,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633153094] [2020-02-10 20:47:25,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:25,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:25,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:25,706 INFO L87 Difference]: Start difference. First operand 1573 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:47:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:25,884 INFO L93 Difference]: Finished difference Result 2953 states and 11733 transitions. [2020-02-10 20:47:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:25,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:25,892 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:47:25,893 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:47:25,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:47:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:47:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:47:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 20:47:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 20:47:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:25,959 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 20:47:25,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 20:47:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:25,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:25,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:25,962 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash -651762734, now seen corresponding path program 490 times [2020-02-10 20:47:25,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:25,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030222114] [2020-02-10 20:47:25,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:26,497 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:26,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030222114] [2020-02-10 20:47:26,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:26,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:26,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475387160] [2020-02-10 20:47:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:26,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:26,505 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:47:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:26,714 INFO L93 Difference]: Finished difference Result 2952 states and 11727 transitions. [2020-02-10 20:47:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:26,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:26,721 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:47:26,722 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:47:26,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:47:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1573. [2020-02-10 20:47:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:47:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7052 transitions. [2020-02-10 20:47:26,788 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7052 transitions. Word has length 28 [2020-02-10 20:47:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:26,788 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7052 transitions. [2020-02-10 20:47:26,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7052 transitions. [2020-02-10 20:47:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:26,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:26,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] [2020-02-10 20:47:26,791 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash -408690810, now seen corresponding path program 491 times [2020-02-10 20:47:26,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:26,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851570896] [2020-02-10 20:47:26,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:27,316 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:27,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851570896] [2020-02-10 20:47:27,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:27,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:27,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813823025] [2020-02-10 20:47:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:27,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:27,324 INFO L87 Difference]: Start difference. First operand 1573 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:47:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:27,461 INFO L93 Difference]: Finished difference Result 2964 states and 11749 transitions. [2020-02-10 20:47:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:27,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:27,468 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:47:27,468 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:47:27,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:47:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 20:47:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:47:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7060 transitions. [2020-02-10 20:47:27,534 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7060 transitions. Word has length 28 [2020-02-10 20:47:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:27,534 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7060 transitions. [2020-02-10 20:47:27,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7060 transitions. [2020-02-10 20:47:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:27,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:27,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:27,537 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:27,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1724848114, now seen corresponding path program 492 times [2020-02-10 20:47:27,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:27,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790399145] [2020-02-10 20:47:27,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:28,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790399145] [2020-02-10 20:47:28,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:28,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:28,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55143728] [2020-02-10 20:47:28,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:28,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:28,084 INFO L87 Difference]: Start difference. First operand 1578 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:47:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:28,274 INFO L93 Difference]: Finished difference Result 2958 states and 11733 transitions. [2020-02-10 20:47:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:28,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:28,282 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:47:28,282 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:47:28,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:47:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1568. [2020-02-10 20:47:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:47:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7038 transitions. [2020-02-10 20:47:28,348 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7038 transitions. Word has length 28 [2020-02-10 20:47:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:28,348 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7038 transitions. [2020-02-10 20:47:28,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7038 transitions. [2020-02-10 20:47:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:28,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:28,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:28,350 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1331663438, now seen corresponding path program 493 times [2020-02-10 20:47:28,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:28,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816413457] [2020-02-10 20:47:28,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:28,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816413457] [2020-02-10 20:47:28,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:28,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:28,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488324881] [2020-02-10 20:47:28,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:28,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:28,880 INFO L87 Difference]: Start difference. First operand 1568 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:47:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:29,057 INFO L93 Difference]: Finished difference Result 2953 states and 11734 transitions. [2020-02-10 20:47:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:29,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:29,064 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:47:29,064 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:47:29,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:47:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:47:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:47:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 20:47:29,130 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 20:47:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:29,131 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 20:47:29,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 20:47:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:29,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:29,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:29,133 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -729196364, now seen corresponding path program 494 times [2020-02-10 20:47:29,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:29,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032334569] [2020-02-10 20:47:29,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:29,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032334569] [2020-02-10 20:47:29,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:29,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:29,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935007358] [2020-02-10 20:47:29,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:29,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:29,655 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:47:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:29,835 INFO L93 Difference]: Finished difference Result 2956 states and 11735 transitions. [2020-02-10 20:47:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:29,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:29,843 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:47:29,843 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:47:29,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:47:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 20:47:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:47:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7049 transitions. [2020-02-10 20:47:29,909 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7049 transitions. Word has length 28 [2020-02-10 20:47:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:29,909 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7049 transitions. [2020-02-10 20:47:29,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7049 transitions. [2020-02-10 20:47:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:29,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:29,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] [2020-02-10 20:47:29,911 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1869519016, now seen corresponding path program 495 times [2020-02-10 20:47:29,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:29,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871703182] [2020-02-10 20:47:29,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:30,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871703182] [2020-02-10 20:47:30,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:30,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:30,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466008926] [2020-02-10 20:47:30,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:30,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:30,451 INFO L87 Difference]: Start difference. First operand 1572 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:47:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:30,624 INFO L93 Difference]: Finished difference Result 2948 states and 11719 transitions. [2020-02-10 20:47:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:30,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:30,632 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:47:30,632 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:47:30,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:47:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1576. [2020-02-10 20:47:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:47:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7056 transitions. [2020-02-10 20:47:30,699 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7056 transitions. Word has length 28 [2020-02-10 20:47:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:30,699 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7056 transitions. [2020-02-10 20:47:30,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7056 transitions. [2020-02-10 20:47:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:30,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:30,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:30,702 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2042766708, now seen corresponding path program 496 times [2020-02-10 20:47:30,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:30,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185639545] [2020-02-10 20:47:30,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:31,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185639545] [2020-02-10 20:47:31,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:31,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:31,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407675596] [2020-02-10 20:47:31,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:31,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:31,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:31,232 INFO L87 Difference]: Start difference. First operand 1576 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:47:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:31,415 INFO L93 Difference]: Finished difference Result 2947 states and 11713 transitions. [2020-02-10 20:47:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:31,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:31,423 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:47:31,423 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:47:31,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:47:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1572. [2020-02-10 20:47:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:47:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7045 transitions. [2020-02-10 20:47:31,490 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7045 transitions. Word has length 28 [2020-02-10 20:47:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:31,490 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7045 transitions. [2020-02-10 20:47:31,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7045 transitions. [2020-02-10 20:47:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:31,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:31,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] [2020-02-10 20:47:31,492 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 346514792, now seen corresponding path program 497 times [2020-02-10 20:47:31,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:31,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243174475] [2020-02-10 20:47:31,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:32,017 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:47:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:32,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243174475] [2020-02-10 20:47:32,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:32,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:32,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506127654] [2020-02-10 20:47:32,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:32,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:32,024 INFO L87 Difference]: Start difference. First operand 1572 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:47:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:32,218 INFO L93 Difference]: Finished difference Result 2954 states and 11727 transitions. [2020-02-10 20:47:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:32,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:32,225 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 20:47:32,225 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:47:32,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:47:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1576. [2020-02-10 20:47:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:47:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7052 transitions. [2020-02-10 20:47:32,292 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7052 transitions. Word has length 28 [2020-02-10 20:47:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:32,292 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7052 transitions. [2020-02-10 20:47:32,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7052 transitions. [2020-02-10 20:47:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:32,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:32,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:32,294 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:32,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1714345010, now seen corresponding path program 498 times [2020-02-10 20:47:32,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:32,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657110031] [2020-02-10 20:47:32,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:32,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657110031] [2020-02-10 20:47:32,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:32,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:32,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387219453] [2020-02-10 20:47:32,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:32,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:32,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:32,811 INFO L87 Difference]: Start difference. First operand 1576 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:47:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:32,988 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 20:47:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:32,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:32,996 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:47:32,996 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:47:32,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:47:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1568. [2020-02-10 20:47:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:47:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7034 transitions. [2020-02-10 20:47:33,063 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7034 transitions. Word has length 28 [2020-02-10 20:47:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:33,063 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7034 transitions. [2020-02-10 20:47:33,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7034 transitions. [2020-02-10 20:47:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:33,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:33,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:33,066 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1452892654, now seen corresponding path program 499 times [2020-02-10 20:47:33,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:33,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476120345] [2020-02-10 20:47:33,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:33,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476120345] [2020-02-10 20:47:33,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:33,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:33,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814365528] [2020-02-10 20:47:33,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:33,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:33,619 INFO L87 Difference]: Start difference. First operand 1568 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:47:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:33,756 INFO L93 Difference]: Finished difference Result 2981 states and 11788 transitions. [2020-02-10 20:47:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:33,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:33,764 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:47:33,764 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:47:33,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:47:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1584. [2020-02-10 20:47:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:47:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7071 transitions. [2020-02-10 20:47:33,851 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7071 transitions. Word has length 28 [2020-02-10 20:47:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:33,851 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7071 transitions. [2020-02-10 20:47:33,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7071 transitions. [2020-02-10 20:47:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:33,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:33,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:33,853 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:33,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash -708190156, now seen corresponding path program 500 times [2020-02-10 20:47:33,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:33,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999365121] [2020-02-10 20:47:33,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:34,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999365121] [2020-02-10 20:47:34,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:34,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:34,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570840802] [2020-02-10 20:47:34,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:34,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:34,393 INFO L87 Difference]: Start difference. First operand 1584 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:47:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:34,560 INFO L93 Difference]: Finished difference Result 2979 states and 11776 transitions. [2020-02-10 20:47:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:34,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:34,569 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:47:34,569 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:47:34,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:47:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1574. [2020-02-10 20:47:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:47:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7048 transitions. [2020-02-10 20:47:34,635 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7048 transitions. Word has length 28 [2020-02-10 20:47:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:34,635 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7048 transitions. [2020-02-10 20:47:34,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7048 transitions. [2020-02-10 20:47:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:34,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:34,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:34,638 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -915037076, now seen corresponding path program 501 times [2020-02-10 20:47:34,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:34,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764830813] [2020-02-10 20:47:34,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:35,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764830813] [2020-02-10 20:47:35,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:35,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:35,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125983548] [2020-02-10 20:47:35,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:35,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:35,155 INFO L87 Difference]: Start difference. First operand 1574 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:47:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:35,285 INFO L93 Difference]: Finished difference Result 2972 states and 11761 transitions. [2020-02-10 20:47:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:35,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:35,293 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:47:35,293 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:47:35,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:47:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1579. [2020-02-10 20:47:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:47:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7056 transitions. [2020-02-10 20:47:35,360 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7056 transitions. Word has length 28 [2020-02-10 20:47:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:35,360 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7056 transitions. [2020-02-10 20:47:35,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7056 transitions. [2020-02-10 20:47:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:35,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:35,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:35,362 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2063772916, now seen corresponding path program 502 times [2020-02-10 20:47:35,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:35,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461503912] [2020-02-10 20:47:35,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:35,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461503912] [2020-02-10 20:47:35,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:35,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:35,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896289314] [2020-02-10 20:47:35,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:35,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:35,883 INFO L87 Difference]: Start difference. First operand 1579 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:47:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:36,049 INFO L93 Difference]: Finished difference Result 2966 states and 11745 transitions. [2020-02-10 20:47:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:36,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:36,057 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:47:36,057 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:47:36,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:47:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1574. [2020-02-10 20:47:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:47:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7043 transitions. [2020-02-10 20:47:36,124 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7043 transitions. Word has length 28 [2020-02-10 20:47:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:36,124 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7043 transitions. [2020-02-10 20:47:36,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7043 transitions. [2020-02-10 20:47:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:36,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:36,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:36,127 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1440606380, now seen corresponding path program 503 times [2020-02-10 20:47:36,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:36,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310487680] [2020-02-10 20:47:36,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:36,647 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:47:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:36,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310487680] [2020-02-10 20:47:36,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:36,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:36,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261344347] [2020-02-10 20:47:36,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:36,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:36,654 INFO L87 Difference]: Start difference. First operand 1574 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:47:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:36,832 INFO L93 Difference]: Finished difference Result 2967 states and 11748 transitions. [2020-02-10 20:47:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:36,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:36,839 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:47:36,840 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:47:36,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:47:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1578. [2020-02-10 20:47:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:47:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7050 transitions. [2020-02-10 20:47:36,906 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7050 transitions. Word has length 28 [2020-02-10 20:47:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:36,907 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7050 transitions. [2020-02-10 20:47:36,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7050 transitions. [2020-02-10 20:47:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:36,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:36,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] [2020-02-10 20:47:36,909 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash -620253422, now seen corresponding path program 504 times [2020-02-10 20:47:36,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:36,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453393034] [2020-02-10 20:47:36,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:37,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453393034] [2020-02-10 20:47:37,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:37,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:37,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328650150] [2020-02-10 20:47:37,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:37,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:37,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:37,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:37,430 INFO L87 Difference]: Start difference. First operand 1578 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:47:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:37,615 INFO L93 Difference]: Finished difference Result 2963 states and 11736 transitions. [2020-02-10 20:47:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:37,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:37,623 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:47:37,623 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:47:37,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:47:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1562. [2020-02-10 20:47:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:47:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7017 transitions. [2020-02-10 20:47:37,696 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7017 transitions. Word has length 28 [2020-02-10 20:47:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:37,696 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7017 transitions. [2020-02-10 20:47:37,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7017 transitions. [2020-02-10 20:47:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:37,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:37,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] [2020-02-10 20:47:37,699 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1384607460, now seen corresponding path program 505 times [2020-02-10 20:47:37,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:37,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949587838] [2020-02-10 20:47:37,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:38,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949587838] [2020-02-10 20:47:38,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:38,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:38,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413374820] [2020-02-10 20:47:38,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:38,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:38,243 INFO L87 Difference]: Start difference. First operand 1562 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:47:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:38,448 INFO L93 Difference]: Finished difference Result 2991 states and 11839 transitions. [2020-02-10 20:47:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:38,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:38,456 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:47:38,456 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:47:38,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:47:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1583. [2020-02-10 20:47:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:47:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7085 transitions. [2020-02-10 20:47:38,523 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7085 transitions. Word has length 28 [2020-02-10 20:47:38,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:38,523 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7085 transitions. [2020-02-10 20:47:38,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7085 transitions. [2020-02-10 20:47:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:38,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:38,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:38,526 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:38,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1420954840, now seen corresponding path program 506 times [2020-02-10 20:47:38,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:38,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655222506] [2020-02-10 20:47:38,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:39,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655222506] [2020-02-10 20:47:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:39,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273501911] [2020-02-10 20:47:39,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:39,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:39,068 INFO L87 Difference]: Start difference. First operand 1583 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:47:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:39,207 INFO L93 Difference]: Finished difference Result 2996 states and 11843 transitions. [2020-02-10 20:47:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:39,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:39,215 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:47:39,216 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:47:39,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:47:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1577. [2020-02-10 20:47:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:47:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7068 transitions. [2020-02-10 20:47:39,282 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7068 transitions. Word has length 28 [2020-02-10 20:47:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:39,282 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7068 transitions. [2020-02-10 20:47:39,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7068 transitions. [2020-02-10 20:47:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:39,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:39,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:39,285 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1299418878, now seen corresponding path program 507 times [2020-02-10 20:47:39,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:39,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327373040] [2020-02-10 20:47:39,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:39,728 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2020-02-10 20:47:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:39,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327373040] [2020-02-10 20:47:39,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:39,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:39,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031283509] [2020-02-10 20:47:39,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:39,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:39,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:39,849 INFO L87 Difference]: Start difference. First operand 1577 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:47:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:40,050 INFO L93 Difference]: Finished difference Result 2988 states and 11828 transitions. [2020-02-10 20:47:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:40,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:40,057 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:47:40,057 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:47:40,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:47:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1582. [2020-02-10 20:47:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:47:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7077 transitions. [2020-02-10 20:47:40,124 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7077 transitions. Word has length 28 [2020-02-10 20:47:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:40,124 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7077 transitions. [2020-02-10 20:47:40,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7077 transitions. [2020-02-10 20:47:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:40,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:40,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:40,126 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 934688616, now seen corresponding path program 508 times [2020-02-10 20:47:40,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:40,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447386357] [2020-02-10 20:47:40,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:40,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447386357] [2020-02-10 20:47:40,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:40,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:40,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450690478] [2020-02-10 20:47:40,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:40,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:40,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:40,664 INFO L87 Difference]: Start difference. First operand 1582 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:47:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:40,873 INFO L93 Difference]: Finished difference Result 2991 states and 11829 transitions. [2020-02-10 20:47:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:40,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:40,880 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:47:40,880 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:47:40,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:47:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1577. [2020-02-10 20:47:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:47:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 20:47:40,947 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 20:47:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:40,948 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 20:47:40,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 20:47:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:40,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47: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] [2020-02-10 20:47:40,950 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash -883099262, now seen corresponding path program 509 times [2020-02-10 20:47:40,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:40,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354134472] [2020-02-10 20:47:40,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:41,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354134472] [2020-02-10 20:47:41,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:41,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:41,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254441659] [2020-02-10 20:47:41,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:41,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:41,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:41,503 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:47:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:41,727 INFO L93 Difference]: Finished difference Result 3003 states and 11853 transitions. [2020-02-10 20:47:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:41,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:41,734 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:47:41,734 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:47:41,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:47:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1587. [2020-02-10 20:47:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:47:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7080 transitions. [2020-02-10 20:47:41,800 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7080 transitions. Word has length 28 [2020-02-10 20:47:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:41,801 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7080 transitions. [2020-02-10 20:47:41,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7080 transitions. [2020-02-10 20:47:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:41,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:41,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:41,803 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash -138396764, now seen corresponding path program 510 times [2020-02-10 20:47:41,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:41,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522543809] [2020-02-10 20:47:41,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:42,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522543809] [2020-02-10 20:47:42,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:42,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:42,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988100709] [2020-02-10 20:47:42,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:42,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:42,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:42,354 INFO L87 Difference]: Start difference. First operand 1587 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:47:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:42,598 INFO L93 Difference]: Finished difference Result 3001 states and 11841 transitions. [2020-02-10 20:47:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:42,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:42,606 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:47:42,606 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:47:42,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:47:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1570. [2020-02-10 20:47:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:47:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 20:47:42,673 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 20:47:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:42,673 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 20:47:42,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 20:47:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:42,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:42,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:42,675 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1972352782, now seen corresponding path program 511 times [2020-02-10 20:47:42,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:42,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259382438] [2020-02-10 20:47:42,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:43,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259382438] [2020-02-10 20:47:43,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:43,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:43,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220620235] [2020-02-10 20:47:43,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:43,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:43,207 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:47:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:43,400 INFO L93 Difference]: Finished difference Result 2987 states and 11824 transitions. [2020-02-10 20:47:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:43,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:43,408 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:47:43,408 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:47:43,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:47:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1582. [2020-02-10 20:47:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:47:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7076 transitions. [2020-02-10 20:47:43,475 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7076 transitions. Word has length 28 [2020-02-10 20:47:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:43,475 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7076 transitions. [2020-02-10 20:47:43,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7076 transitions. [2020-02-10 20:47:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:43,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:43,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:43,477 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash -833209518, now seen corresponding path program 512 times [2020-02-10 20:47:43,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:43,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890370886] [2020-02-10 20:47:43,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:44,015 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:47:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:44,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890370886] [2020-02-10 20:47:44,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:44,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:44,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057033655] [2020-02-10 20:47:44,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:44,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:44,022 INFO L87 Difference]: Start difference. First operand 1582 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:47:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:44,214 INFO L93 Difference]: Finished difference Result 2992 states and 11828 transitions. [2020-02-10 20:47:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:44,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:44,222 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:47:44,222 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:47:44,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:47:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1576. [2020-02-10 20:47:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:47:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7059 transitions. [2020-02-10 20:47:44,288 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7059 transitions. Word has length 28 [2020-02-10 20:47:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:44,288 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7059 transitions. [2020-02-10 20:47:44,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7059 transitions. [2020-02-10 20:47:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:44,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:44,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:44,291 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1246903358, now seen corresponding path program 513 times [2020-02-10 20:47:44,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:44,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681556196] [2020-02-10 20:47:44,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:44,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681556196] [2020-02-10 20:47:44,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:44,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:44,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683267381] [2020-02-10 20:47:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:44,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:44,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:44,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:44,809 INFO L87 Difference]: Start difference. First operand 1576 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:47:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:44,994 INFO L93 Difference]: Finished difference Result 2983 states and 11811 transitions. [2020-02-10 20:47:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:44,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:45,002 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:47:45,003 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:47:45,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:47:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1581. [2020-02-10 20:47:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:47:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7068 transitions. [2020-02-10 20:47:45,069 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7068 transitions. Word has length 28 [2020-02-10 20:47:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:45,069 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7068 transitions. [2020-02-10 20:47:45,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7068 transitions. [2020-02-10 20:47:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:45,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:45,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] [2020-02-10 20:47:45,071 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 415749330, now seen corresponding path program 514 times [2020-02-10 20:47:45,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:45,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456405801] [2020-02-10 20:47:45,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:45,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456405801] [2020-02-10 20:47:45,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:45,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:45,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349530980] [2020-02-10 20:47:45,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:45,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:45,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:45,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:45,606 INFO L87 Difference]: Start difference. First operand 1581 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:47:45,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:45,797 INFO L93 Difference]: Finished difference Result 2985 states and 11810 transitions. [2020-02-10 20:47:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:45,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:45,805 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:47:45,805 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:47:45,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:47:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1576. [2020-02-10 20:47:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:47:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 20:47:45,891 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 20:47:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:45,891 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 20:47:45,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 20:47:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:45,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:45,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:45,893 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -830583742, now seen corresponding path program 515 times [2020-02-10 20:47:45,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:45,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735900218] [2020-02-10 20:47:45,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:46,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735900218] [2020-02-10 20:47:46,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:46,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:46,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211682756] [2020-02-10 20:47:46,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:46,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:46,445 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:47:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:46,626 INFO L93 Difference]: Finished difference Result 2996 states and 11832 transitions. [2020-02-10 20:47:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:46,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:46,634 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:47:46,635 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:47:46,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:47:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1584. [2020-02-10 20:47:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:47:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7068 transitions. [2020-02-10 20:47:46,702 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7068 transitions. Word has length 28 [2020-02-10 20:47:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:46,702 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7068 transitions. [2020-02-10 20:47:46,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7068 transitions. [2020-02-10 20:47:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:46,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:46,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:46,704 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -657336050, now seen corresponding path program 516 times [2020-02-10 20:47:46,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:46,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704054669] [2020-02-10 20:47:46,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:47,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704054669] [2020-02-10 20:47:47,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:47,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:47,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165713857] [2020-02-10 20:47:47,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:47,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:47,232 INFO L87 Difference]: Start difference. First operand 1584 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:47:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:47,472 INFO L93 Difference]: Finished difference Result 2993 states and 11819 transitions. [2020-02-10 20:47:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:47,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:47,479 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:47:47,479 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:47:47,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:47:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1570. [2020-02-10 20:47:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:47:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7037 transitions. [2020-02-10 20:47:47,548 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7037 transitions. Word has length 28 [2020-02-10 20:47:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:47,548 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7037 transitions. [2020-02-10 20:47:47,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7037 transitions. [2020-02-10 20:47:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:47,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:47,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:47,551 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1982855886, now seen corresponding path program 517 times [2020-02-10 20:47:47,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:47,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250044698] [2020-02-10 20:47:47,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:48,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250044698] [2020-02-10 20:47:48,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:48,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:48,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287582889] [2020-02-10 20:47:48,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:48,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:48,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:48,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:48,082 INFO L87 Difference]: Start difference. First operand 1570 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:47:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:48,352 INFO L93 Difference]: Finished difference Result 2979 states and 11803 transitions. [2020-02-10 20:47:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:48,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:48,360 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:47:48,360 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:47:48,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:47:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1580. [2020-02-10 20:47:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:47:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7065 transitions. [2020-02-10 20:47:48,426 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7065 transitions. Word has length 28 [2020-02-10 20:47:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:48,427 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7065 transitions. [2020-02-10 20:47:48,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7065 transitions. [2020-02-10 20:47:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:48,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:48,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] [2020-02-10 20:47:48,429 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash -78003916, now seen corresponding path program 518 times [2020-02-10 20:47:48,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:48,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467464895] [2020-02-10 20:47:48,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:48,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467464895] [2020-02-10 20:47:48,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:48,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:48,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185114927] [2020-02-10 20:47:48,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:48,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:48,964 INFO L87 Difference]: Start difference. First operand 1580 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:47:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:49,134 INFO L93 Difference]: Finished difference Result 2982 states and 11804 transitions. [2020-02-10 20:47:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:49,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:49,142 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:47:49,142 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:47:49,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:47:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1575. [2020-02-10 20:47:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:47:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 20:47:49,208 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 20:47:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:49,208 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 20:47:49,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 20:47:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:49,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:49,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] [2020-02-10 20:47:49,210 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1447626084, now seen corresponding path program 519 times [2020-02-10 20:47:49,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:49,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226942320] [2020-02-10 20:47:49,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:49,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226942320] [2020-02-10 20:47:49,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:49,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:49,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114889312] [2020-02-10 20:47:49,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:49,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:49,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:49,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:49,732 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:47:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:49,913 INFO L93 Difference]: Finished difference Result 2978 states and 11796 transitions. [2020-02-10 20:47:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:49,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:49,921 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:47:49,921 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:47:49,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:47:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1580. [2020-02-10 20:47:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:47:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7060 transitions. [2020-02-10 20:47:49,988 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7060 transitions. Word has length 28 [2020-02-10 20:47:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:49,988 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7060 transitions. [2020-02-10 20:47:49,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7060 transitions. [2020-02-10 20:47:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:49,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:49,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:49,990 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1184688524, now seen corresponding path program 520 times [2020-02-10 20:47:49,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:49,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027440585] [2020-02-10 20:47:49,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:50,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027440585] [2020-02-10 20:47:50,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:50,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:50,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884426477] [2020-02-10 20:47:50,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:50,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:50,531 INFO L87 Difference]: Start difference. First operand 1580 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:47:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:50,719 INFO L93 Difference]: Finished difference Result 2980 states and 11795 transitions. [2020-02-10 20:47:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:50,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:50,727 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:47:50,727 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:47:50,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:47:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1575. [2020-02-10 20:47:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:47:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 20:47:50,794 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 20:47:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:50,794 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 20:47:50,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 20:47:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:50,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:50,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:50,797 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:50,797 INFO L82 PathProgramCache]: Analyzing trace with hash -75378140, now seen corresponding path program 521 times [2020-02-10 20:47:50,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:50,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88811735] [2020-02-10 20:47:50,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:51,332 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:47:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:51,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88811735] [2020-02-10 20:47:51,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:51,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:51,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257442347] [2020-02-10 20:47:51,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:51,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:51,339 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:47:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:51,525 INFO L93 Difference]: Finished difference Result 2986 states and 11809 transitions. [2020-02-10 20:47:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:51,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:51,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:51,532 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:47:51,533 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:47:51,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:47:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1582. [2020-02-10 20:47:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:47:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7059 transitions. [2020-02-10 20:47:51,599 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7059 transitions. Word has length 28 [2020-02-10 20:47:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:51,600 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7059 transitions. [2020-02-10 20:47:51,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7059 transitions. [2020-02-10 20:47:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:51,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:51,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] [2020-02-10 20:47:51,602 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -646832946, now seen corresponding path program 522 times [2020-02-10 20:47:51,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:51,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130042992] [2020-02-10 20:47:51,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:52,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130042992] [2020-02-10 20:47:52,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:52,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:52,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573434807] [2020-02-10 20:47:52,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:52,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:52,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:52,151 INFO L87 Difference]: Start difference. First operand 1582 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:47:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:52,353 INFO L93 Difference]: Finished difference Result 2985 states and 11800 transitions. [2020-02-10 20:47:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:52,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:52,361 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:47:52,362 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:47:52,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:47:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1570. [2020-02-10 20:47:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:47:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 20:47:52,427 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 20:47:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:52,427 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 20:47:52,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 20:47:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:52,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47: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] [2020-02-10 20:47:52,429 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash -801700206, now seen corresponding path program 523 times [2020-02-10 20:47:52,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:52,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859930924] [2020-02-10 20:47:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:52,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859930924] [2020-02-10 20:47:52,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:52,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:52,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50412576] [2020-02-10 20:47:52,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:52,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:52,979 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:47:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:53,122 INFO L93 Difference]: Finished difference Result 3012 states and 11871 transitions. [2020-02-10 20:47:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:53,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:53,130 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:47:53,130 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 20:47:53,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 20:47:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1590. [2020-02-10 20:47:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:47:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7082 transitions. [2020-02-10 20:47:53,196 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7082 transitions. Word has length 28 [2020-02-10 20:47:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:53,197 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7082 transitions. [2020-02-10 20:47:53,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7082 transitions. [2020-02-10 20:47:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:53,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:53,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:53,199 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:53,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash -56997708, now seen corresponding path program 524 times [2020-02-10 20:47:53,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:53,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492541541] [2020-02-10 20:47:53,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:53,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492541541] [2020-02-10 20:47:53,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:53,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:53,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660468477] [2020-02-10 20:47:53,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:53,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:53,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:53,753 INFO L87 Difference]: Start difference. First operand 1590 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:47:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:53,931 INFO L93 Difference]: Finished difference Result 3010 states and 11859 transitions. [2020-02-10 20:47:53,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:53,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:53,939 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:47:53,940 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 20:47:53,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 20:47:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1580. [2020-02-10 20:47:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:47:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7056 transitions. [2020-02-10 20:47:54,006 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7056 transitions. Word has length 28 [2020-02-10 20:47:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:54,006 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7056 transitions. [2020-02-10 20:47:54,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7056 transitions. [2020-02-10 20:47:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:54,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:54,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] [2020-02-10 20:47:54,009 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1336930008, now seen corresponding path program 525 times [2020-02-10 20:47:54,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:54,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129027101] [2020-02-10 20:47:54,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:54,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129027101] [2020-02-10 20:47:54,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:54,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:54,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109323518] [2020-02-10 20:47:54,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:54,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:54,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:54,575 INFO L87 Difference]: Start difference. First operand 1580 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:47:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:54,718 INFO L93 Difference]: Finished difference Result 3009 states and 11856 transitions. [2020-02-10 20:47:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:54,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:54,725 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:47:54,725 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:47:54,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:47:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1588. [2020-02-10 20:47:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:47:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7070 transitions. [2020-02-10 20:47:54,792 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7070 transitions. Word has length 28 [2020-02-10 20:47:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:54,792 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7070 transitions. [2020-02-10 20:47:54,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7070 transitions. [2020-02-10 20:47:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:54,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:54,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:54,795 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1163682316, now seen corresponding path program 526 times [2020-02-10 20:47:54,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:54,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771202584] [2020-02-10 20:47:54,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:55,334 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:47:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771202584] [2020-02-10 20:47:55,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:55,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:55,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879487710] [2020-02-10 20:47:55,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:55,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:55,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:55,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:55,342 INFO L87 Difference]: Start difference. First operand 1588 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:47:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:55,515 INFO L93 Difference]: Finished difference Result 3006 states and 11843 transitions. [2020-02-10 20:47:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:55,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:55,522 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:47:55,522 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:47:55,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:47:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1580. [2020-02-10 20:47:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:47:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7048 transitions. [2020-02-10 20:47:55,588 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7048 transitions. Word has length 28 [2020-02-10 20:47:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:55,588 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7048 transitions. [2020-02-10 20:47:55,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7048 transitions. [2020-02-10 20:47:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:55,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:55,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:55,591 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1018713448, now seen corresponding path program 527 times [2020-02-10 20:47:55,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:55,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717352169] [2020-02-10 20:47:55,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:56,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717352169] [2020-02-10 20:47:56,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:56,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:56,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460978230] [2020-02-10 20:47:56,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:56,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:56,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:56,137 INFO L87 Difference]: Start difference. First operand 1580 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:47:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:56,318 INFO L93 Difference]: Finished difference Result 3004 states and 11840 transitions. [2020-02-10 20:47:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:56,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:56,326 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:47:56,326 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:47:56,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:47:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1587. [2020-02-10 20:47:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:47:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7061 transitions. [2020-02-10 20:47:56,393 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7061 transitions. Word has length 28 [2020-02-10 20:47:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:56,393 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7061 transitions. [2020-02-10 20:47:56,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7061 transitions. [2020-02-10 20:47:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:56,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:56,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:56,395 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash 447258642, now seen corresponding path program 528 times [2020-02-10 20:47:56,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:56,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379078492] [2020-02-10 20:47:56,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:56,929 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:47:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:56,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379078492] [2020-02-10 20:47:56,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:56,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:56,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188345831] [2020-02-10 20:47:56,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:56,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:56,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:56,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:56,937 INFO L87 Difference]: Start difference. First operand 1587 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:47:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:57,108 INFO L93 Difference]: Finished difference Result 3003 states and 11831 transitions. [2020-02-10 20:47:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:57,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:57,115 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:47:57,116 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:47:57,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:47:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1562. [2020-02-10 20:47:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:47:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7010 transitions. [2020-02-10 20:47:57,184 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7010 transitions. Word has length 28 [2020-02-10 20:47:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:57,184 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7010 transitions. [2020-02-10 20:47:57,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7010 transitions. [2020-02-10 20:47:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:57,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:57,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:57,186 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:57,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1933571164, now seen corresponding path program 529 times [2020-02-10 20:47:57,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:57,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892091491] [2020-02-10 20:47:57,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:57,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892091491] [2020-02-10 20:47:57,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:57,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:57,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861463664] [2020-02-10 20:47:57,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:57,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:57,710 INFO L87 Difference]: Start difference. First operand 1562 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:47:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:57,909 INFO L93 Difference]: Finished difference Result 2955 states and 11734 transitions. [2020-02-10 20:47:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:57,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:57,916 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:47:57,917 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:47:57,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:47:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1578. [2020-02-10 20:47:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:47:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7062 transitions. [2020-02-10 20:47:58,003 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7062 transitions. Word has length 28 [2020-02-10 20:47:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:58,003 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7062 transitions. [2020-02-10 20:47:58,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7062 transitions. [2020-02-10 20:47:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:58,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:58,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] [2020-02-10 20:47:58,006 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash -444166168, now seen corresponding path program 530 times [2020-02-10 20:47:58,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:58,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421614379] [2020-02-10 20:47:58,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:58,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 20:47:58,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421614379] [2020-02-10 20:47:58,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:58,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:58,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783431774] [2020-02-10 20:47:58,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:58,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:58,519 INFO L87 Difference]: Start difference. First operand 1578 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:47:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:58,689 INFO L93 Difference]: Finished difference Result 2960 states and 11738 transitions. [2020-02-10 20:47:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:58,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:58,698 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:47:58,698 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:47:58,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:47:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1572. [2020-02-10 20:47:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:47:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 20:47:58,769 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 20:47:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:58,769 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 20:47:58,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 20:47:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:58,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:58,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:58,772 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 215225372, now seen corresponding path program 531 times [2020-02-10 20:47:58,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:58,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921883838] [2020-02-10 20:47:58,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:59,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921883838] [2020-02-10 20:47:59,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:59,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:47:59,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706711669] [2020-02-10 20:47:59,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:47:59,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:47:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:59,302 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:47:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:59,488 INFO L93 Difference]: Finished difference Result 2947 states and 11713 transitions. [2020-02-10 20:47:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:47:59,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:47:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:59,495 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:47:59,496 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:47:59,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:47:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:47:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1576. [2020-02-10 20:47:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:47:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7053 transitions. [2020-02-10 20:47:59,564 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7053 transitions. Word has length 28 [2020-02-10 20:47:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:59,564 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7053 transitions. [2020-02-10 20:47:59,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:47:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7053 transitions. [2020-02-10 20:47:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:47:59,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:59,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] [2020-02-10 20:47:59,566 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:47:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 388473064, now seen corresponding path program 532 times [2020-02-10 20:47:59,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:59,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702138800] [2020-02-10 20:47:59,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:00,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702138800] [2020-02-10 20:48:00,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:00,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:00,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792748641] [2020-02-10 20:48:00,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:00,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:00,091 INFO L87 Difference]: Start difference. First operand 1576 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:48:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:00,285 INFO L93 Difference]: Finished difference Result 2946 states and 11707 transitions. [2020-02-10 20:48:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:00,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:00,292 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:48:00,292 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:48:00,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:48:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1572. [2020-02-10 20:48:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:48:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7042 transitions. [2020-02-10 20:48:00,361 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7042 transitions. Word has length 28 [2020-02-10 20:48:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:00,361 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7042 transitions. [2020-02-10 20:48:00,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7042 transitions. [2020-02-10 20:48:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:00,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:00,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:00,363 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash 631544988, now seen corresponding path program 533 times [2020-02-10 20:48:00,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:00,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785459680] [2020-02-10 20:48:00,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:00,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785459680] [2020-02-10 20:48:00,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:00,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:00,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41941728] [2020-02-10 20:48:00,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:00,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:00,887 INFO L87 Difference]: Start difference. First operand 1572 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:48:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:01,053 INFO L93 Difference]: Finished difference Result 2958 states and 11729 transitions. [2020-02-10 20:48:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:01,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:01,061 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:48:01,061 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:48:01,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:48:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 20:48:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7050 transitions. [2020-02-10 20:48:01,129 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7050 transitions. Word has length 28 [2020-02-10 20:48:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:01,129 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7050 transitions. [2020-02-10 20:48:01,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7050 transitions. [2020-02-10 20:48:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:01,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:01,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] [2020-02-10 20:48:01,132 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash -684612316, now seen corresponding path program 534 times [2020-02-10 20:48:01,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:01,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958657649] [2020-02-10 20:48:01,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:01,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958657649] [2020-02-10 20:48:01,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:01,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:01,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470660032] [2020-02-10 20:48:01,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:01,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:01,657 INFO L87 Difference]: Start difference. First operand 1577 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:48:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:01,846 INFO L93 Difference]: Finished difference Result 2952 states and 11713 transitions. [2020-02-10 20:48:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:01,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:01,854 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:48:01,855 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:48:01,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:48:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1567. [2020-02-10 20:48:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:48:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7028 transitions. [2020-02-10 20:48:01,921 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7028 transitions. Word has length 28 [2020-02-10 20:48:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:01,921 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7028 transitions. [2020-02-10 20:48:01,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7028 transitions. [2020-02-10 20:48:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:01,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:01,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] [2020-02-10 20:48:01,924 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -839479576, now seen corresponding path program 535 times [2020-02-10 20:48:01,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:01,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357703992] [2020-02-10 20:48:01,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:02,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357703992] [2020-02-10 20:48:02,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:02,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:02,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559216260] [2020-02-10 20:48:02,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:02,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:02,453 INFO L87 Difference]: Start difference. First operand 1567 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:48:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:02,656 INFO L93 Difference]: Finished difference Result 2963 states and 11751 transitions. [2020-02-10 20:48:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:02,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:02,663 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:48:02,664 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:48:02,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:48:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1579. [2020-02-10 20:48:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:48:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7061 transitions. [2020-02-10 20:48:02,731 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7061 transitions. Word has length 28 [2020-02-10 20:48:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:02,731 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7061 transitions. [2020-02-10 20:48:02,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7061 transitions. [2020-02-10 20:48:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:02,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:02,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] [2020-02-10 20:48:02,733 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 649925420, now seen corresponding path program 536 times [2020-02-10 20:48:02,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:02,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393139692] [2020-02-10 20:48:02,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:03,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393139692] [2020-02-10 20:48:03,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:03,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:03,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918273267] [2020-02-10 20:48:03,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:03,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:03,257 INFO L87 Difference]: Start difference. First operand 1579 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:48:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:03,462 INFO L93 Difference]: Finished difference Result 2968 states and 11755 transitions. [2020-02-10 20:48:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:03,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:03,469 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:48:03,469 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:48:03,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:48:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1573. [2020-02-10 20:48:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:48:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:48:03,537 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:48:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:03,537 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:48:03,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:48:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:03,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:03,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] [2020-02-10 20:48:03,540 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 236231580, now seen corresponding path program 537 times [2020-02-10 20:48:03,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:03,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464475585] [2020-02-10 20:48:03,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:04,078 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:48:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:04,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464475585] [2020-02-10 20:48:04,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:04,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:04,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505601623] [2020-02-10 20:48:04,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:04,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:04,086 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:48:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:04,308 INFO L93 Difference]: Finished difference Result 2959 states and 11738 transitions. [2020-02-10 20:48:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:04,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:04,316 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:48:04,316 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:48:04,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:48:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 20:48:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:48:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7053 transitions. [2020-02-10 20:48:04,384 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7053 transitions. Word has length 28 [2020-02-10 20:48:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:04,384 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7053 transitions. [2020-02-10 20:48:04,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7053 transitions. [2020-02-10 20:48:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:04,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:04,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:04,387 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1898884268, now seen corresponding path program 538 times [2020-02-10 20:48:04,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:04,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939447569] [2020-02-10 20:48:04,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:04,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939447569] [2020-02-10 20:48:04,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:04,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:04,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121466525] [2020-02-10 20:48:04,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:04,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:04,903 INFO L87 Difference]: Start difference. First operand 1578 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:48:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:05,124 INFO L93 Difference]: Finished difference Result 2961 states and 11737 transitions. [2020-02-10 20:48:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:05,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:05,132 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:48:05,133 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:48:05,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:48:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1573. [2020-02-10 20:48:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:48:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7039 transitions. [2020-02-10 20:48:05,199 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7039 transitions. Word has length 28 [2020-02-10 20:48:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:05,199 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7039 transitions. [2020-02-10 20:48:05,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7039 transitions. [2020-02-10 20:48:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:05,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:05,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] [2020-02-10 20:48:05,202 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 652551196, now seen corresponding path program 539 times [2020-02-10 20:48:05,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:05,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358493393] [2020-02-10 20:48:05,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:05,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358493393] [2020-02-10 20:48:05,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:05,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:05,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406113658] [2020-02-10 20:48:05,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:05,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:05,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:05,732 INFO L87 Difference]: Start difference. First operand 1573 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:48:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:05,882 INFO L93 Difference]: Finished difference Result 2972 states and 11759 transitions. [2020-02-10 20:48:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:05,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:05,890 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:48:05,890 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:48:05,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:48:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 20:48:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:48:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7053 transitions. [2020-02-10 20:48:05,959 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7053 transitions. Word has length 28 [2020-02-10 20:48:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:05,959 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7053 transitions. [2020-02-10 20:48:05,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7053 transitions. [2020-02-10 20:48:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:05,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:05,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] [2020-02-10 20:48:05,961 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 825798888, now seen corresponding path program 540 times [2020-02-10 20:48:05,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:05,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486696109] [2020-02-10 20:48:05,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:06,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486696109] [2020-02-10 20:48:06,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:06,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469566838] [2020-02-10 20:48:06,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:06,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:06,475 INFO L87 Difference]: Start difference. First operand 1581 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:48:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:06,678 INFO L93 Difference]: Finished difference Result 2969 states and 11746 transitions. [2020-02-10 20:48:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:06,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:06,686 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:48:06,686 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:48:06,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:48:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1567. [2020-02-10 20:48:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:48:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7023 transitions. [2020-02-10 20:48:06,754 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7023 transitions. Word has length 28 [2020-02-10 20:48:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:06,754 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7023 transitions. [2020-02-10 20:48:06,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7023 transitions. [2020-02-10 20:48:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:06,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:06,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] [2020-02-10 20:48:06,757 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -797467160, now seen corresponding path program 541 times [2020-02-10 20:48:06,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:06,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566374603] [2020-02-10 20:48:06,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:07,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566374603] [2020-02-10 20:48:07,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:07,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:07,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875410336] [2020-02-10 20:48:07,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:07,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:07,282 INFO L87 Difference]: Start difference. First operand 1567 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:48:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:07,488 INFO L93 Difference]: Finished difference Result 2941 states and 11696 transitions. [2020-02-10 20:48:07,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:07,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:07,495 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:48:07,496 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:48:07,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:48:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1575. [2020-02-10 20:48:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:48:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7045 transitions. [2020-02-10 20:48:07,562 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7045 transitions. Word has length 28 [2020-02-10 20:48:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:07,562 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7045 transitions. [2020-02-10 20:48:07,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7045 transitions. [2020-02-10 20:48:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:07,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:07,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] [2020-02-10 20:48:07,564 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash -624219468, now seen corresponding path program 542 times [2020-02-10 20:48:07,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:07,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481655807] [2020-02-10 20:48:07,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:08,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481655807] [2020-02-10 20:48:08,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:08,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:08,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304641301] [2020-02-10 20:48:08,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:08,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:08,089 INFO L87 Difference]: Start difference. First operand 1575 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:48:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:08,265 INFO L93 Difference]: Finished difference Result 2940 states and 11690 transitions. [2020-02-10 20:48:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:08,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:08,273 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:48:08,273 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 20:48:08,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 20:48:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1571. [2020-02-10 20:48:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:48:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7034 transitions. [2020-02-10 20:48:08,339 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7034 transitions. Word has length 28 [2020-02-10 20:48:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:08,339 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7034 transitions. [2020-02-10 20:48:08,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7034 transitions. [2020-02-10 20:48:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:08,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:08,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] [2020-02-10 20:48:08,342 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:08,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1870552540, now seen corresponding path program 543 times [2020-02-10 20:48:08,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:08,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225458397] [2020-02-10 20:48:08,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:08,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225458397] [2020-02-10 20:48:08,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:08,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:08,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17478975] [2020-02-10 20:48:08,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:08,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:08,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:08,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:08,857 INFO L87 Difference]: Start difference. First operand 1571 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:48:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:09,035 INFO L93 Difference]: Finished difference Result 2945 states and 11701 transitions. [2020-02-10 20:48:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:09,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:09,044 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:48:09,044 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:48:09,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:48:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:48:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:48:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7043 transitions. [2020-02-10 20:48:09,116 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7043 transitions. Word has length 28 [2020-02-10 20:48:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:09,116 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7043 transitions. [2020-02-10 20:48:09,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7043 transitions. [2020-02-10 20:48:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:09,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:09,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] [2020-02-10 20:48:09,119 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -207899852, now seen corresponding path program 544 times [2020-02-10 20:48:09,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:09,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9225284] [2020-02-10 20:48:09,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:09,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9225284] [2020-02-10 20:48:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:09,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:09,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623763988] [2020-02-10 20:48:09,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:09,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:09,637 INFO L87 Difference]: Start difference. First operand 1576 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:48:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:09,832 INFO L93 Difference]: Finished difference Result 2947 states and 11700 transitions. [2020-02-10 20:48:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:09,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:09,840 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:48:09,840 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:48:09,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:48:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:48:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:48:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7030 transitions. [2020-02-10 20:48:09,906 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7030 transitions. Word has length 28 [2020-02-10 20:48:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:09,906 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7030 transitions. [2020-02-10 20:48:09,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7030 transitions. [2020-02-10 20:48:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:09,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:09,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] [2020-02-10 20:48:09,909 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash -621593692, now seen corresponding path program 545 times [2020-02-10 20:48:09,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:09,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440891175] [2020-02-10 20:48:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:10,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440891175] [2020-02-10 20:48:10,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:10,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:10,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615962861] [2020-02-10 20:48:10,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:10,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:10,451 INFO L87 Difference]: Start difference. First operand 1571 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:48:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:10,659 INFO L93 Difference]: Finished difference Result 2942 states and 11690 transitions. [2020-02-10 20:48:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:10,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:10,666 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:48:10,667 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:48:10,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:48:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 20:48:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:48:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7037 transitions. [2020-02-10 20:48:10,733 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7037 transitions. Word has length 28 [2020-02-10 20:48:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:10,733 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7037 transitions. [2020-02-10 20:48:10,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7037 transitions. [2020-02-10 20:48:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:10,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:10,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:10,736 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash 867811304, now seen corresponding path program 546 times [2020-02-10 20:48:10,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:10,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819733399] [2020-02-10 20:48:10,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:11,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819733399] [2020-02-10 20:48:11,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:11,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:11,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977606292] [2020-02-10 20:48:11,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:11,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:11,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:11,243 INFO L87 Difference]: Start difference. First operand 1575 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:48:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:11,453 INFO L93 Difference]: Finished difference Result 2945 states and 11692 transitions. [2020-02-10 20:48:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:11,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:11,461 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:48:11,461 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:48:11,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:48:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1567. [2020-02-10 20:48:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:48:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7019 transitions. [2020-02-10 20:48:11,529 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7019 transitions. Word has length 28 [2020-02-10 20:48:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:11,529 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7019 transitions. [2020-02-10 20:48:11,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7019 transitions. [2020-02-10 20:48:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:11,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:11,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:11,532 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash 712944044, now seen corresponding path program 547 times [2020-02-10 20:48:11,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:11,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259610634] [2020-02-10 20:48:11,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:12,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259610634] [2020-02-10 20:48:12,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:12,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:12,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541797338] [2020-02-10 20:48:12,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:12,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:12,086 INFO L87 Difference]: Start difference. First operand 1567 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:48:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:12,257 INFO L93 Difference]: Finished difference Result 2962 states and 11734 transitions. [2020-02-10 20:48:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:12,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:12,265 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:48:12,265 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:48:12,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:48:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1577. [2020-02-10 20:48:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7045 transitions. [2020-02-10 20:48:12,331 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7045 transitions. Word has length 28 [2020-02-10 20:48:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:12,332 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7045 transitions. [2020-02-10 20:48:12,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7045 transitions. [2020-02-10 20:48:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:12,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:12,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] [2020-02-10 20:48:12,334 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:12,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash -603213260, now seen corresponding path program 548 times [2020-02-10 20:48:12,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:12,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578184014] [2020-02-10 20:48:12,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:12,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578184014] [2020-02-10 20:48:12,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:12,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:12,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820102021] [2020-02-10 20:48:12,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:12,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:12,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:12,869 INFO L87 Difference]: Start difference. First operand 1577 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:48:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:13,083 INFO L93 Difference]: Finished difference Result 2956 states and 11718 transitions. [2020-02-10 20:48:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:13,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:13,091 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:48:13,091 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:48:13,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:48:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1572. [2020-02-10 20:48:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:48:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7032 transitions. [2020-02-10 20:48:13,162 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7032 transitions. Word has length 28 [2020-02-10 20:48:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:13,162 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7032 transitions. [2020-02-10 20:48:13,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7032 transitions. [2020-02-10 20:48:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:13,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:13,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] [2020-02-10 20:48:13,165 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash -360141336, now seen corresponding path program 549 times [2020-02-10 20:48:13,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:13,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22992448] [2020-02-10 20:48:13,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:13,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22992448] [2020-02-10 20:48:13,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:13,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:13,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199623224] [2020-02-10 20:48:13,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:13,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:13,702 INFO L87 Difference]: Start difference. First operand 1572 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:48:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:13,865 INFO L93 Difference]: Finished difference Result 2968 states and 11744 transitions. [2020-02-10 20:48:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:13,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:13,873 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:48:13,873 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:48:13,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:48:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 20:48:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:48:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7046 transitions. [2020-02-10 20:48:13,939 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7046 transitions. Word has length 28 [2020-02-10 20:48:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:13,939 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7046 transitions. [2020-02-10 20:48:13,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7046 transitions. [2020-02-10 20:48:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:13,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:13,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] [2020-02-10 20:48:13,942 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -186893644, now seen corresponding path program 550 times [2020-02-10 20:48:13,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:13,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635406133] [2020-02-10 20:48:13,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:14,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635406133] [2020-02-10 20:48:14,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:14,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:14,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156320871] [2020-02-10 20:48:14,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:14,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:14,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:14,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:14,473 INFO L87 Difference]: Start difference. First operand 1580 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:48:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:14,728 INFO L93 Difference]: Finished difference Result 2965 states and 11731 transitions. [2020-02-10 20:48:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:14,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:14,737 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:48:14,737 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:48:14,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:48:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1572. [2020-02-10 20:48:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:48:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7027 transitions. [2020-02-10 20:48:14,803 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7027 transitions. Word has length 28 [2020-02-10 20:48:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:14,803 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7027 transitions. [2020-02-10 20:48:14,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7027 transitions. [2020-02-10 20:48:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:14,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:14,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:14,805 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash 472497896, now seen corresponding path program 551 times [2020-02-10 20:48:14,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:14,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886657772] [2020-02-10 20:48:14,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:15,328 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:48:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:15,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886657772] [2020-02-10 20:48:15,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:15,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:15,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35809321] [2020-02-10 20:48:15,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:15,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:15,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:15,335 INFO L87 Difference]: Start difference. First operand 1572 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:48:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:15,530 INFO L93 Difference]: Finished difference Result 2952 states and 11706 transitions. [2020-02-10 20:48:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:15,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:15,538 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:48:15,538 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:48:15,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:48:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1576. [2020-02-10 20:48:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:48:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7034 transitions. [2020-02-10 20:48:15,604 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7034 transitions. Word has length 28 [2020-02-10 20:48:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:15,604 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7034 transitions. [2020-02-10 20:48:15,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7034 transitions. [2020-02-10 20:48:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:15,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:15,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] [2020-02-10 20:48:15,607 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1961902892, now seen corresponding path program 552 times [2020-02-10 20:48:15,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:15,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990338210] [2020-02-10 20:48:15,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:16,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990338210] [2020-02-10 20:48:16,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:16,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:16,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176624684] [2020-02-10 20:48:16,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:16,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:16,125 INFO L87 Difference]: Start difference. First operand 1576 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:48:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:16,404 INFO L93 Difference]: Finished difference Result 2955 states and 11708 transitions. [2020-02-10 20:48:16,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:16,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:16,412 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:48:16,412 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:48:16,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:48:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1562. [2020-02-10 20:48:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:48:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7005 transitions. [2020-02-10 20:48:16,477 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7005 transitions. Word has length 28 [2020-02-10 20:48:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:16,478 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7005 transitions. [2020-02-10 20:48:16,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7005 transitions. [2020-02-10 20:48:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:16,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:16,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:16,480 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2966018, now seen corresponding path program 553 times [2020-02-10 20:48:16,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:16,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970262027] [2020-02-10 20:48:16,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:16,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970262027] [2020-02-10 20:48:16,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:16,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:16,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941366901] [2020-02-10 20:48:16,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:16,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:16,998 INFO L87 Difference]: Start difference. First operand 1562 states and 7005 transitions. Second operand 11 states. [2020-02-10 20:48:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:17,212 INFO L93 Difference]: Finished difference Result 2938 states and 11692 transitions. [2020-02-10 20:48:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:17,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:17,220 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:48:17,220 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:48:17,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:48:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1575. [2020-02-10 20:48:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:48:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 20:48:17,286 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 20:48:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:17,286 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 20:48:17,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 20:48:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:17,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:17,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:17,289 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2057893784, now seen corresponding path program 554 times [2020-02-10 20:48:17,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:17,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898174029] [2020-02-10 20:48:17,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:17,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898174029] [2020-02-10 20:48:17,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:17,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:17,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710973178] [2020-02-10 20:48:17,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:17,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:17,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:17,806 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:48:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:18,075 INFO L93 Difference]: Finished difference Result 2941 states and 11693 transitions. [2020-02-10 20:48:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:18,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:18,083 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:48:18,083 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:48:18,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:48:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1570. [2020-02-10 20:48:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:48:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7035 transitions. [2020-02-10 20:48:18,149 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7035 transitions. Word has length 28 [2020-02-10 20:48:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:18,149 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7035 transitions. [2020-02-10 20:48:18,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7035 transitions. [2020-02-10 20:48:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:18,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:18,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] [2020-02-10 20:48:18,151 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 540821596, now seen corresponding path program 555 times [2020-02-10 20:48:18,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:18,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51554597] [2020-02-10 20:48:18,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:18,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51554597] [2020-02-10 20:48:18,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:18,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:18,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182303304] [2020-02-10 20:48:18,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:18,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:18,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:18,672 INFO L87 Difference]: Start difference. First operand 1570 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:48:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:18,941 INFO L93 Difference]: Finished difference Result 2933 states and 11677 transitions. [2020-02-10 20:48:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:18,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:18,949 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:48:18,950 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 20:48:18,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 20:48:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1574. [2020-02-10 20:48:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7042 transitions. [2020-02-10 20:48:19,017 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7042 transitions. Word has length 28 [2020-02-10 20:48:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:19,017 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7042 transitions. [2020-02-10 20:48:19,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7042 transitions. [2020-02-10 20:48:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:19,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:19,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] [2020-02-10 20:48:19,020 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 714069288, now seen corresponding path program 556 times [2020-02-10 20:48:19,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:19,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625705817] [2020-02-10 20:48:19,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:19,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625705817] [2020-02-10 20:48:19,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:19,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:19,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621831502] [2020-02-10 20:48:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:19,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:19,546 INFO L87 Difference]: Start difference. First operand 1574 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:48:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:19,786 INFO L93 Difference]: Finished difference Result 2932 states and 11671 transitions. [2020-02-10 20:48:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:19,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:19,792 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:48:19,793 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 20:48:19,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 20:48:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 20:48:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:48:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 20:48:19,859 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 20:48:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:19,859 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 20:48:19,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 20:48:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:19,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:19,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] [2020-02-10 20:48:19,861 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash -982182628, now seen corresponding path program 557 times [2020-02-10 20:48:19,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:19,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394192148] [2020-02-10 20:48:19,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:20,372 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:48:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:20,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394192148] [2020-02-10 20:48:20,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:20,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:20,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574835403] [2020-02-10 20:48:20,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:20,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:20,379 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:48:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:20,644 INFO L93 Difference]: Finished difference Result 2939 states and 11685 transitions. [2020-02-10 20:48:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:20,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:20,652 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:48:20,652 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:48:20,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:48:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1574. [2020-02-10 20:48:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7038 transitions. [2020-02-10 20:48:20,720 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7038 transitions. Word has length 28 [2020-02-10 20:48:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:20,720 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7038 transitions. [2020-02-10 20:48:20,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7038 transitions. [2020-02-10 20:48:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:20,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:20,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] [2020-02-10 20:48:20,722 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1251924866, now seen corresponding path program 558 times [2020-02-10 20:48:20,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:20,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007296720] [2020-02-10 20:48:20,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:21,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007296720] [2020-02-10 20:48:21,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:21,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:21,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389507179] [2020-02-10 20:48:21,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:21,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:21,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:21,233 INFO L87 Difference]: Start difference. First operand 1574 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:48:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:21,499 INFO L93 Difference]: Finished difference Result 2935 states and 11673 transitions. [2020-02-10 20:48:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:21,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:21,507 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:48:21,507 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:48:21,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:48:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1566. [2020-02-10 20:48:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:48:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7020 transitions. [2020-02-10 20:48:21,572 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7020 transitions. Word has length 28 [2020-02-10 20:48:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:21,572 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7020 transitions. [2020-02-10 20:48:21,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7020 transitions. [2020-02-10 20:48:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:21,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:21,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:21,575 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1097057606, now seen corresponding path program 559 times [2020-02-10 20:48:21,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:21,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173169492] [2020-02-10 20:48:21,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:22,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173169492] [2020-02-10 20:48:22,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:22,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:22,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838210615] [2020-02-10 20:48:22,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:22,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:22,097 INFO L87 Difference]: Start difference. First operand 1566 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:48:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:22,357 INFO L93 Difference]: Finished difference Result 2946 states and 11710 transitions. [2020-02-10 20:48:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:22,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:22,365 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 20:48:22,365 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:48:22,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:48:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1576. [2020-02-10 20:48:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:48:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7048 transitions. [2020-02-10 20:48:22,432 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7048 transitions. Word has length 28 [2020-02-10 20:48:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:22,432 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7048 transitions. [2020-02-10 20:48:22,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7048 transitions. [2020-02-10 20:48:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:22,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:22,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:22,435 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash -963802196, now seen corresponding path program 560 times [2020-02-10 20:48:22,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:22,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510596490] [2020-02-10 20:48:22,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:22,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510596490] [2020-02-10 20:48:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:22,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470446195] [2020-02-10 20:48:22,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:22,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:22,969 INFO L87 Difference]: Start difference. First operand 1576 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:48:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:23,229 INFO L93 Difference]: Finished difference Result 2949 states and 11711 transitions. [2020-02-10 20:48:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:23,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:23,237 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:48:23,237 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:48:23,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:48:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1571. [2020-02-10 20:48:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:48:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7034 transitions. [2020-02-10 20:48:23,303 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7034 transitions. Word has length 28 [2020-02-10 20:48:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:23,303 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7034 transitions. [2020-02-10 20:48:23,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7034 transitions. [2020-02-10 20:48:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:23,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:23,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:23,305 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:23,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash 561827804, now seen corresponding path program 561 times [2020-02-10 20:48:23,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:23,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402505050] [2020-02-10 20:48:23,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:23,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402505050] [2020-02-10 20:48:23,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:23,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:23,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495651116] [2020-02-10 20:48:23,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:23,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:23,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:23,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:23,828 INFO L87 Difference]: Start difference. First operand 1571 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:48:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:24,000 INFO L93 Difference]: Finished difference Result 2945 states and 11703 transitions. [2020-02-10 20:48:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:24,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:24,007 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 20:48:24,007 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:48:24,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:48:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 20:48:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:48:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7043 transitions. [2020-02-10 20:48:24,073 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7043 transitions. Word has length 28 [2020-02-10 20:48:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:24,073 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7043 transitions. [2020-02-10 20:48:24,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7043 transitions. [2020-02-10 20:48:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:24,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:24,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] [2020-02-10 20:48:24,076 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2070486804, now seen corresponding path program 562 times [2020-02-10 20:48:24,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:24,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404295335] [2020-02-10 20:48:24,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:24,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 20:48:24,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404295335] [2020-02-10 20:48:24,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:24,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:24,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143983084] [2020-02-10 20:48:24,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:24,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:24,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:24,594 INFO L87 Difference]: Start difference. First operand 1576 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:48:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:24,774 INFO L93 Difference]: Finished difference Result 2947 states and 11702 transitions. [2020-02-10 20:48:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:24,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:24,781 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:48:24,781 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:48:24,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:48:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 20:48:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:48:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7029 transitions. [2020-02-10 20:48:24,847 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7029 transitions. Word has length 28 [2020-02-10 20:48:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:24,847 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7029 transitions. [2020-02-10 20:48:24,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7029 transitions. [2020-02-10 20:48:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:24,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:24,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:24,850 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -961176420, now seen corresponding path program 563 times [2020-02-10 20:48:24,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:24,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456988846] [2020-02-10 20:48:24,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:25,373 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:48:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:25,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456988846] [2020-02-10 20:48:25,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:25,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:25,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497068894] [2020-02-10 20:48:25,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:25,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:25,381 INFO L87 Difference]: Start difference. First operand 1571 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:48:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:25,550 INFO L93 Difference]: Finished difference Result 2953 states and 11716 transitions. [2020-02-10 20:48:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:25,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:25,557 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:48:25,557 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:48:25,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:48:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1578. [2020-02-10 20:48:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:48:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7042 transitions. [2020-02-10 20:48:25,623 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7042 transitions. Word has length 28 [2020-02-10 20:48:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:25,623 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7042 transitions. [2020-02-10 20:48:25,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7042 transitions. [2020-02-10 20:48:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:25,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:25,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:25,626 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1532631226, now seen corresponding path program 564 times [2020-02-10 20:48:25,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:25,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100687465] [2020-02-10 20:48:25,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:26,141 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:48:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100687465] [2020-02-10 20:48:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:26,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325622135] [2020-02-10 20:48:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:26,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:26,148 INFO L87 Difference]: Start difference. First operand 1578 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:48:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:26,323 INFO L93 Difference]: Finished difference Result 2952 states and 11707 transitions. [2020-02-10 20:48:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:26,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:26,330 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:48:26,331 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 20:48:26,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 20:48:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1566. [2020-02-10 20:48:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:48:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7016 transitions. [2020-02-10 20:48:26,397 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7016 transitions. Word has length 28 [2020-02-10 20:48:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:26,397 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7016 transitions. [2020-02-10 20:48:26,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7016 transitions. [2020-02-10 20:48:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:26,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:26,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] [2020-02-10 20:48:26,400 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:26,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1128566918, now seen corresponding path program 565 times [2020-02-10 20:48:26,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:26,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784423458] [2020-02-10 20:48:26,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:26,929 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:48:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:26,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784423458] [2020-02-10 20:48:26,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:26,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:26,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553039444] [2020-02-10 20:48:26,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:26,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:26,936 INFO L87 Difference]: Start difference. First operand 1566 states and 7016 transitions. Second operand 11 states. [2020-02-10 20:48:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:27,106 INFO L93 Difference]: Finished difference Result 2932 states and 11671 transitions. [2020-02-10 20:48:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:27,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:27,114 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:48:27,114 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 20:48:27,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 20:48:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1574. [2020-02-10 20:48:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7038 transitions. [2020-02-10 20:48:27,180 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7038 transitions. Word has length 28 [2020-02-10 20:48:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:27,180 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7038 transitions. [2020-02-10 20:48:27,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7038 transitions. [2020-02-10 20:48:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:27,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:27,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:27,183 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:27,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1301814610, now seen corresponding path program 566 times [2020-02-10 20:48:27,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:27,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532584403] [2020-02-10 20:48:27,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:27,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532584403] [2020-02-10 20:48:27,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:27,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:27,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55487655] [2020-02-10 20:48:27,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:27,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:27,716 INFO L87 Difference]: Start difference. First operand 1574 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:48:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:27,901 INFO L93 Difference]: Finished difference Result 2931 states and 11665 transitions. [2020-02-10 20:48:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:27,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:27,908 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 20:48:27,908 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:48:27,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:48:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1570. [2020-02-10 20:48:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:48:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7027 transitions. [2020-02-10 20:48:27,974 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7027 transitions. Word has length 28 [2020-02-10 20:48:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:27,974 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7027 transitions. [2020-02-10 20:48:27,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7027 transitions. [2020-02-10 20:48:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:27,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:27,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:27,976 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 55481538, now seen corresponding path program 567 times [2020-02-10 20:48:27,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:27,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044032032] [2020-02-10 20:48:27,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:28,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044032032] [2020-02-10 20:48:28,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:28,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:28,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107426381] [2020-02-10 20:48:28,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:28,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:28,497 INFO L87 Difference]: Start difference. First operand 1570 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:48:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:28,662 INFO L93 Difference]: Finished difference Result 2936 states and 11676 transitions. [2020-02-10 20:48:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:28,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:28,670 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:48:28,670 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:48:28,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:48:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1575. [2020-02-10 20:48:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:48:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7036 transitions. [2020-02-10 20:48:28,759 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7036 transitions. Word has length 28 [2020-02-10 20:48:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:28,760 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7036 transitions. [2020-02-10 20:48:28,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7036 transitions. [2020-02-10 20:48:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:28,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:28,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] [2020-02-10 20:48:28,762 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1718134226, now seen corresponding path program 568 times [2020-02-10 20:48:28,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:28,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673744908] [2020-02-10 20:48:28,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:29,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673744908] [2020-02-10 20:48:29,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:29,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:29,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356814141] [2020-02-10 20:48:29,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:29,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:29,290 INFO L87 Difference]: Start difference. First operand 1575 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:48:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:29,470 INFO L93 Difference]: Finished difference Result 2938 states and 11675 transitions. [2020-02-10 20:48:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:29,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:29,478 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:48:29,478 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:48:29,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:48:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1570. [2020-02-10 20:48:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:48:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 20:48:29,544 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 20:48:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:29,544 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 20:48:29,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 20:48:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:29,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:29,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] [2020-02-10 20:48:29,547 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1304440386, now seen corresponding path program 569 times [2020-02-10 20:48:29,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:29,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721031955] [2020-02-10 20:48:29,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:30,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721031955] [2020-02-10 20:48:30,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:30,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:30,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078927284] [2020-02-10 20:48:30,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:30,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:30,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:30,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:30,078 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:48:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:30,258 INFO L93 Difference]: Finished difference Result 2933 states and 11665 transitions. [2020-02-10 20:48:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:30,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:30,265 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:48:30,266 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:48:30,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:48:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1574. [2020-02-10 20:48:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 20:48:30,331 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 20:48:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:30,331 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 20:48:30,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 20:48:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:30,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:30,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] [2020-02-10 20:48:30,334 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1501121914, now seen corresponding path program 570 times [2020-02-10 20:48:30,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:30,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698906782] [2020-02-10 20:48:30,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:30,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698906782] [2020-02-10 20:48:30,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:30,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:30,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343885795] [2020-02-10 20:48:30,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:30,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:30,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:30,858 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:48:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:31,046 INFO L93 Difference]: Finished difference Result 2936 states and 11667 transitions. [2020-02-10 20:48:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:31,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:31,054 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 20:48:31,054 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 20:48:31,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 20:48:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1566. [2020-02-10 20:48:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:48:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7012 transitions. [2020-02-10 20:48:31,120 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7012 transitions. Word has length 28 [2020-02-10 20:48:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:31,120 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7012 transitions. [2020-02-10 20:48:31,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7012 transitions. [2020-02-10 20:48:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:31,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:31,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] [2020-02-10 20:48:31,123 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash -900783572, now seen corresponding path program 571 times [2020-02-10 20:48:31,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:31,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141634968] [2020-02-10 20:48:31,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:31,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141634968] [2020-02-10 20:48:31,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:31,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:31,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254485703] [2020-02-10 20:48:31,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:31,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:31,642 INFO L87 Difference]: Start difference. First operand 1566 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:48:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:31,824 INFO L93 Difference]: Finished difference Result 2943 states and 11691 transitions. [2020-02-10 20:48:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:31,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:31,832 INFO L225 Difference]: With dead ends: 2943 [2020-02-10 20:48:31,832 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 20:48:31,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 20:48:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1574. [2020-02-10 20:48:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7034 transitions. [2020-02-10 20:48:31,898 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7034 transitions. Word has length 28 [2020-02-10 20:48:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:31,898 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7034 transitions. [2020-02-10 20:48:31,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7034 transitions. [2020-02-10 20:48:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:31,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:31,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:31,901 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1333323922, now seen corresponding path program 572 times [2020-02-10 20:48:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:31,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022515665] [2020-02-10 20:48:31,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:32,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022515665] [2020-02-10 20:48:32,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:32,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:32,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005196774] [2020-02-10 20:48:32,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:32,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:32,411 INFO L87 Difference]: Start difference. First operand 1574 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:48:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:32,579 INFO L93 Difference]: Finished difference Result 2939 states and 11679 transitions. [2020-02-10 20:48:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:32,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:32,587 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:48:32,587 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 20:48:32,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 20:48:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1570. [2020-02-10 20:48:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:48:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 20:48:32,653 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 20:48:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:32,653 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 20:48:32,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 20:48:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:32,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:32,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] [2020-02-10 20:48:32,656 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1973868952, now seen corresponding path program 573 times [2020-02-10 20:48:32,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:32,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358903780] [2020-02-10 20:48:32,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:33,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358903780] [2020-02-10 20:48:33,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:33,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:33,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022416967] [2020-02-10 20:48:33,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:33,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:33,179 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:48:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:33,360 INFO L93 Difference]: Finished difference Result 2949 states and 11702 transitions. [2020-02-10 20:48:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:33,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:33,367 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:48:33,367 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:48:33,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:48:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1577. [2020-02-10 20:48:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7036 transitions. [2020-02-10 20:48:33,433 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7036 transitions. Word has length 28 [2020-02-10 20:48:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:33,433 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7036 transitions. [2020-02-10 20:48:33,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7036 transitions. [2020-02-10 20:48:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:33,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:33,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:33,436 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1749643538, now seen corresponding path program 574 times [2020-02-10 20:48:33,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:33,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393377783] [2020-02-10 20:48:33,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:33,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393377783] [2020-02-10 20:48:33,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:33,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:33,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939144063] [2020-02-10 20:48:33,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:33,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:33,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:33,964 INFO L87 Difference]: Start difference. First operand 1577 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:48:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:34,147 INFO L93 Difference]: Finished difference Result 2948 states and 11693 transitions. [2020-02-10 20:48:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:34,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:34,156 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:48:34,156 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:48:34,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:48:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1570. [2020-02-10 20:48:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:48:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7019 transitions. [2020-02-10 20:48:34,224 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7019 transitions. Word has length 28 [2020-02-10 20:48:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:34,224 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7019 transitions. [2020-02-10 20:48:34,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7019 transitions. [2020-02-10 20:48:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:34,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:34,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] [2020-02-10 20:48:34,226 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 798094120, now seen corresponding path program 575 times [2020-02-10 20:48:34,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:34,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087604791] [2020-02-10 20:48:34,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:34,740 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:48:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:34,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087604791] [2020-02-10 20:48:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738618986] [2020-02-10 20:48:34,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:34,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:34,748 INFO L87 Difference]: Start difference. First operand 1570 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:48:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:34,969 INFO L93 Difference]: Finished difference Result 2938 states and 11673 transitions. [2020-02-10 20:48:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:34,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:34,976 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:48:34,977 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:48:34,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:48:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1574. [2020-02-10 20:48:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7026 transitions. [2020-02-10 20:48:35,043 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7026 transitions. Word has length 28 [2020-02-10 20:48:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:35,043 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7026 transitions. [2020-02-10 20:48:35,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7026 transitions. [2020-02-10 20:48:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:35,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:35,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] [2020-02-10 20:48:35,045 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2007468180, now seen corresponding path program 576 times [2020-02-10 20:48:35,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:35,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67622961] [2020-02-10 20:48:35,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:35,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67622961] [2020-02-10 20:48:35,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:35,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:35,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111908791] [2020-02-10 20:48:35,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:35,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:35,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:35,558 INFO L87 Difference]: Start difference. First operand 1574 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:48:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:35,761 INFO L93 Difference]: Finished difference Result 2941 states and 11675 transitions. [2020-02-10 20:48:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:35,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:35,769 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 20:48:35,769 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:48:35,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:48:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1562. [2020-02-10 20:48:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:48:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7001 transitions. [2020-02-10 20:48:35,835 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7001 transitions. Word has length 28 [2020-02-10 20:48:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:35,835 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7001 transitions. [2020-02-10 20:48:35,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7001 transitions. [2020-02-10 20:48:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:35,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:35,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:35,837 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:35,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1070478082, now seen corresponding path program 577 times [2020-02-10 20:48:35,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:35,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762506783] [2020-02-10 20:48:35,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:36,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762506783] [2020-02-10 20:48:36,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:36,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:36,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649066745] [2020-02-10 20:48:36,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:36,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:36,376 INFO L87 Difference]: Start difference. First operand 1562 states and 7001 transitions. Second operand 11 states. [2020-02-10 20:48:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:36,568 INFO L93 Difference]: Finished difference Result 2991 states and 11808 transitions. [2020-02-10 20:48:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:36,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:36,576 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:48:36,576 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:48:36,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:48:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1585. [2020-02-10 20:48:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:48:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7066 transitions. [2020-02-10 20:48:36,642 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7066 transitions. Word has length 28 [2020-02-10 20:48:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:36,642 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7066 transitions. [2020-02-10 20:48:36,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7066 transitions. [2020-02-10 20:48:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:36,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:36,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:36,645 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1815180580, now seen corresponding path program 578 times [2020-02-10 20:48:36,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:36,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630246799] [2020-02-10 20:48:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:37,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630246799] [2020-02-10 20:48:37,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:37,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:37,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254328551] [2020-02-10 20:48:37,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:37,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:37,184 INFO L87 Difference]: Start difference. First operand 1585 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:48:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:37,365 INFO L93 Difference]: Finished difference Result 2989 states and 11796 transitions. [2020-02-10 20:48:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:37,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:37,374 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:48:37,374 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:48:37,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:48:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:48:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:48:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 20:48:37,440 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 20:48:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:37,440 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 20:48:37,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 20:48:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:37,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:37,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:37,443 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:37,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1608333660, now seen corresponding path program 579 times [2020-02-10 20:48:37,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:37,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861289915] [2020-02-10 20:48:37,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:37,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861289915] [2020-02-10 20:48:37,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:37,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:37,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173455926] [2020-02-10 20:48:37,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:37,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:37,963 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:48:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:38,102 INFO L93 Difference]: Finished difference Result 2982 states and 11781 transitions. [2020-02-10 20:48:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:38,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:38,109 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:48:38,109 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:48:38,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:48:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1580. [2020-02-10 20:48:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:48:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 20:48:38,176 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 20:48:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:38,176 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 20:48:38,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 20:48:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:38,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:38,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:38,178 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash 292176356, now seen corresponding path program 580 times [2020-02-10 20:48:38,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:38,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201562696] [2020-02-10 20:48:38,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:38,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201562696] [2020-02-10 20:48:38,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:38,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:38,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618407050] [2020-02-10 20:48:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:38,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:38,695 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:48:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:38,906 INFO L93 Difference]: Finished difference Result 2976 states and 11765 transitions. [2020-02-10 20:48:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:38,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:38,913 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:48:38,913 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:48:38,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:48:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1575. [2020-02-10 20:48:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:48:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7038 transitions. [2020-02-10 20:48:38,979 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7038 transitions. Word has length 28 [2020-02-10 20:48:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:38,979 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7038 transitions. [2020-02-10 20:48:38,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7038 transitions. [2020-02-10 20:48:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:38,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:38,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:38,982 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash -330990180, now seen corresponding path program 581 times [2020-02-10 20:48:38,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:38,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140032864] [2020-02-10 20:48:38,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:39,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140032864] [2020-02-10 20:48:39,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:39,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:39,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344790298] [2020-02-10 20:48:39,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:39,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:39,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:39,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:39,497 INFO L87 Difference]: Start difference. First operand 1575 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:48:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:39,692 INFO L93 Difference]: Finished difference Result 2977 states and 11768 transitions. [2020-02-10 20:48:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:39,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:39,699 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:48:39,699 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:48:39,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:48:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1579. [2020-02-10 20:48:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:48:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7045 transitions. [2020-02-10 20:48:39,765 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7045 transitions. Word has length 28 [2020-02-10 20:48:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:39,766 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7045 transitions. [2020-02-10 20:48:39,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7045 transitions. [2020-02-10 20:48:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:39,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:39,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] [2020-02-10 20:48:39,768 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1903117314, now seen corresponding path program 582 times [2020-02-10 20:48:39,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:39,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485224829] [2020-02-10 20:48:39,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:40,281 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:48:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:40,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485224829] [2020-02-10 20:48:40,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:40,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:40,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059370569] [2020-02-10 20:48:40,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:40,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:40,289 INFO L87 Difference]: Start difference. First operand 1579 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:48:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:40,489 INFO L93 Difference]: Finished difference Result 2973 states and 11756 transitions. [2020-02-10 20:48:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:40,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:40,496 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:48:40,496 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:48:40,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:48:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1569. [2020-02-10 20:48:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:48:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7023 transitions. [2020-02-10 20:48:40,562 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7023 transitions. Word has length 28 [2020-02-10 20:48:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:40,562 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7023 transitions. [2020-02-10 20:48:40,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7023 transitions. [2020-02-10 20:48:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:40,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:40,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] [2020-02-10 20:48:40,565 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2130397626, now seen corresponding path program 583 times [2020-02-10 20:48:40,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:40,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316215117] [2020-02-10 20:48:40,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:41,021 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-02-10 20:48:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:41,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316215117] [2020-02-10 20:48:41,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:41,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:41,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293517006] [2020-02-10 20:48:41,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:41,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:41,143 INFO L87 Difference]: Start difference. First operand 1569 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:48:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:41,276 INFO L93 Difference]: Finished difference Result 3004 states and 11839 transitions. [2020-02-10 20:48:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:41,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:41,284 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:48:41,284 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:48:41,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:48:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1589. [2020-02-10 20:48:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:48:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7073 transitions. [2020-02-10 20:48:41,350 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7073 transitions. Word has length 28 [2020-02-10 20:48:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:41,350 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7073 transitions. [2020-02-10 20:48:41,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7073 transitions. [2020-02-10 20:48:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:41,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:41,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:41,353 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1385695128, now seen corresponding path program 584 times [2020-02-10 20:48:41,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:41,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781539744] [2020-02-10 20:48:41,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:41,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781539744] [2020-02-10 20:48:41,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:41,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:41,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132011952] [2020-02-10 20:48:41,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:41,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:41,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:41,900 INFO L87 Difference]: Start difference. First operand 1589 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:48:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:42,108 INFO L93 Difference]: Finished difference Result 3002 states and 11827 transitions. [2020-02-10 20:48:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:42,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:42,116 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 20:48:42,116 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:48:42,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:48:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1579. [2020-02-10 20:48:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:48:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7047 transitions. [2020-02-10 20:48:42,182 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7047 transitions. Word has length 28 [2020-02-10 20:48:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:42,182 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7047 transitions. [2020-02-10 20:48:42,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7047 transitions. [2020-02-10 20:48:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:42,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:42,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:42,185 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1629339868, now seen corresponding path program 585 times [2020-02-10 20:48:42,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:42,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118328316] [2020-02-10 20:48:42,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:42,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118328316] [2020-02-10 20:48:42,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:42,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:42,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668319002] [2020-02-10 20:48:42,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:42,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:42,738 INFO L87 Difference]: Start difference. First operand 1579 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:48:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:42,868 INFO L93 Difference]: Finished difference Result 3001 states and 11824 transitions. [2020-02-10 20:48:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:42,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:42,876 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:48:42,876 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:48:42,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:48:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1587. [2020-02-10 20:48:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:48:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7061 transitions. [2020-02-10 20:48:42,943 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7061 transitions. Word has length 28 [2020-02-10 20:48:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:42,943 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7061 transitions. [2020-02-10 20:48:42,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7061 transitions. [2020-02-10 20:48:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:42,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:42,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:42,946 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1802587560, now seen corresponding path program 586 times [2020-02-10 20:48:42,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:42,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771738820] [2020-02-10 20:48:42,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48: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 20:48:43,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771738820] [2020-02-10 20:48:43,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:43,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:43,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954591377] [2020-02-10 20:48:43,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:43,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:43,480 INFO L87 Difference]: Start difference. First operand 1587 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:48:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:43,657 INFO L93 Difference]: Finished difference Result 2998 states and 11811 transitions. [2020-02-10 20:48:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:43,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:43,664 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:48:43,664 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:48:43,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:48:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1579. [2020-02-10 20:48:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:48:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7039 transitions. [2020-02-10 20:48:43,731 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7039 transitions. Word has length 28 [2020-02-10 20:48:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:43,731 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7039 transitions. [2020-02-10 20:48:43,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7039 transitions. [2020-02-10 20:48:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:43,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:43,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] [2020-02-10 20:48:43,734 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash -309983972, now seen corresponding path program 587 times [2020-02-10 20:48:43,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898645240] [2020-02-10 20:48:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:44,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898645240] [2020-02-10 20:48:44,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:44,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:44,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626819489] [2020-02-10 20:48:44,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:44,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:44,281 INFO L87 Difference]: Start difference. First operand 1579 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:48:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:44,510 INFO L93 Difference]: Finished difference Result 2996 states and 11808 transitions. [2020-02-10 20:48:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:44,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:44,517 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 20:48:44,517 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:48:44,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:48:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1586. [2020-02-10 20:48:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:48:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7052 transitions. [2020-02-10 20:48:44,584 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7052 transitions. Word has length 28 [2020-02-10 20:48:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:44,584 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7052 transitions. [2020-02-10 20:48:44,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7052 transitions. [2020-02-10 20:48:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:44,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:44,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] [2020-02-10 20:48:44,586 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:44,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash -881438778, now seen corresponding path program 588 times [2020-02-10 20:48:44,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:44,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278219904] [2020-02-10 20:48:44,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48: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 20:48:45,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278219904] [2020-02-10 20:48:45,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:45,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:45,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512074899] [2020-02-10 20:48:45,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:45,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:45,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:45,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:45,127 INFO L87 Difference]: Start difference. First operand 1586 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:48:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:45,307 INFO L93 Difference]: Finished difference Result 2995 states and 11799 transitions. [2020-02-10 20:48:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:45,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:45,315 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:48:45,316 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:48:45,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:48:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1569. [2020-02-10 20:48:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:48:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7016 transitions. [2020-02-10 20:48:45,381 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7016 transitions. Word has length 28 [2020-02-10 20:48:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:45,382 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7016 transitions. [2020-02-10 20:48:45,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7016 transitions. [2020-02-10 20:48:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:45,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:45,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:45,384 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2098888314, now seen corresponding path program 589 times [2020-02-10 20:48:45,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:45,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128375279] [2020-02-10 20:48:45,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:45,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128375279] [2020-02-10 20:48:45,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:45,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:45,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405836516] [2020-02-10 20:48:45,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:45,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:45,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:45,911 INFO L87 Difference]: Start difference. First operand 1569 states and 7016 transitions. Second operand 11 states. [2020-02-10 20:48:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:46,049 INFO L93 Difference]: Finished difference Result 2978 states and 11766 transitions. [2020-02-10 20:48:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:46,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:46,057 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:48:46,057 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:48:46,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:48:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1579. [2020-02-10 20:48:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:48:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7042 transitions. [2020-02-10 20:48:46,123 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7042 transitions. Word has length 28 [2020-02-10 20:48:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:46,123 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7042 transitions. [2020-02-10 20:48:46,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7042 transitions. [2020-02-10 20:48:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:46,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:46,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] [2020-02-10 20:48:46,125 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 879921678, now seen corresponding path program 590 times [2020-02-10 20:48:46,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:46,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463717709] [2020-02-10 20:48:46,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:46,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463717709] [2020-02-10 20:48:46,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:46,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:46,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512537920] [2020-02-10 20:48:46,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:46,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:46,657 INFO L87 Difference]: Start difference. First operand 1579 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:48:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:46,835 INFO L93 Difference]: Finished difference Result 2972 states and 11750 transitions. [2020-02-10 20:48:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:46,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:46,843 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:48:46,844 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:48:46,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:48:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1574. [2020-02-10 20:48:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7029 transitions. [2020-02-10 20:48:46,924 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7029 transitions. Word has length 28 [2020-02-10 20:48:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:46,924 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7029 transitions. [2020-02-10 20:48:46,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7029 transitions. [2020-02-10 20:48:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:46,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:46,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] [2020-02-10 20:48:46,927 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1122993602, now seen corresponding path program 591 times [2020-02-10 20:48:46,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:46,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327889193] [2020-02-10 20:48:46,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:47,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327889193] [2020-02-10 20:48:47,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:47,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:47,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699156560] [2020-02-10 20:48:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:47,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:47,487 INFO L87 Difference]: Start difference. First operand 1574 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:48:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:47,656 INFO L93 Difference]: Finished difference Result 2984 states and 11776 transitions. [2020-02-10 20:48:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:47,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:47,663 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:48:47,663 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:48:47,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:48:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1582. [2020-02-10 20:48:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:48:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7043 transitions. [2020-02-10 20:48:47,730 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7043 transitions. Word has length 28 [2020-02-10 20:48:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:47,730 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7043 transitions. [2020-02-10 20:48:47,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7043 transitions. [2020-02-10 20:48:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:47,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:47,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:47,732 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1296241294, now seen corresponding path program 592 times [2020-02-10 20:48:47,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:47,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676465267] [2020-02-10 20:48:47,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:48,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676465267] [2020-02-10 20:48:48,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:48,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:48,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460260757] [2020-02-10 20:48:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:48,256 INFO L87 Difference]: Start difference. First operand 1582 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:48:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:48,451 INFO L93 Difference]: Finished difference Result 2981 states and 11763 transitions. [2020-02-10 20:48:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:48,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:48,459 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:48:48,459 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:48:48,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:48:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1574. [2020-02-10 20:48:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:48:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7024 transitions. [2020-02-10 20:48:48,525 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7024 transitions. Word has length 28 [2020-02-10 20:48:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:48,526 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7024 transitions. [2020-02-10 20:48:48,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7024 transitions. [2020-02-10 20:48:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:48,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:48,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:48,528 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1955632834, now seen corresponding path program 593 times [2020-02-10 20:48:48,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:48,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418884876] [2020-02-10 20:48:48,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:49,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418884876] [2020-02-10 20:48:49,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:49,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:49,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100781462] [2020-02-10 20:48:49,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:49,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:49,046 INFO L87 Difference]: Start difference. First operand 1574 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:48:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:49,298 INFO L93 Difference]: Finished difference Result 2968 states and 11738 transitions. [2020-02-10 20:48:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:49,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:49,305 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:48:49,305 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:48:49,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:48:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1578. [2020-02-10 20:48:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:48:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7031 transitions. [2020-02-10 20:48:49,371 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7031 transitions. Word has length 28 [2020-02-10 20:48:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:49,371 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7031 transitions. [2020-02-10 20:48:49,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7031 transitions. [2020-02-10 20:48:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:49,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:49,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] [2020-02-10 20:48:49,374 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:49,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:49,374 INFO L82 PathProgramCache]: Analyzing trace with hash -849929466, now seen corresponding path program 594 times [2020-02-10 20:48:49,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:49,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339939383] [2020-02-10 20:48:49,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:49,900 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:48:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:49,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339939383] [2020-02-10 20:48:49,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:49,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:49,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157904689] [2020-02-10 20:48:49,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:49,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:49,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:49,908 INFO L87 Difference]: Start difference. First operand 1578 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:48:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:50,097 INFO L93 Difference]: Finished difference Result 2971 states and 11740 transitions. [2020-02-10 20:48:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:50,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:50,104 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:48:50,104 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:48:50,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:48:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1569. [2020-02-10 20:48:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:48:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7011 transitions. [2020-02-10 20:48:50,171 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7011 transitions. Word has length 28 [2020-02-10 20:48:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:50,171 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7011 transitions. [2020-02-10 20:48:50,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7011 transitions. [2020-02-10 20:48:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:50,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:50,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:50,173 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1343682712, now seen corresponding path program 595 times [2020-02-10 20:48:50,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:50,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190379790] [2020-02-10 20:48:50,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:50,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190379790] [2020-02-10 20:48:50,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:50,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:50,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146647401] [2020-02-10 20:48:50,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:50,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:50,690 INFO L87 Difference]: Start difference. First operand 1569 states and 7011 transitions. Second operand 11 states. [2020-02-10 20:48:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:50,929 INFO L93 Difference]: Finished difference Result 2968 states and 11743 transitions. [2020-02-10 20:48:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:50,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:50,936 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:48:50,936 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:48:50,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:48:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1577. [2020-02-10 20:48:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7033 transitions. [2020-02-10 20:48:51,003 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7033 transitions. Word has length 28 [2020-02-10 20:48:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:51,003 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7033 transitions. [2020-02-10 20:48:51,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7033 transitions. [2020-02-10 20:48:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:51,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:51,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] [2020-02-10 20:48:51,005 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 890424782, now seen corresponding path program 596 times [2020-02-10 20:48:51,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:51,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415389002] [2020-02-10 20:48:51,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:51,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415389002] [2020-02-10 20:48:51,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332168676] [2020-02-10 20:48:51,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:51,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:51,527 INFO L87 Difference]: Start difference. First operand 1577 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:48:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:51,720 INFO L93 Difference]: Finished difference Result 2964 states and 11731 transitions. [2020-02-10 20:48:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:51,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:51,728 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:48:51,728 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:48:51,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:48:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1573. [2020-02-10 20:48:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:48:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7022 transitions. [2020-02-10 20:48:51,794 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7022 transitions. Word has length 28 [2020-02-10 20:48:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:51,794 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7022 transitions. [2020-02-10 20:48:51,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7022 transitions. [2020-02-10 20:48:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:51,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:51,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] [2020-02-10 20:48:51,797 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1878199204, now seen corresponding path program 597 times [2020-02-10 20:48:51,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:51,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818550153] [2020-02-10 20:48:51,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:52,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 20:48:52,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818550153] [2020-02-10 20:48:52,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:52,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:52,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786930446] [2020-02-10 20:48:52,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:52,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:52,341 INFO L87 Difference]: Start difference. First operand 1573 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:48:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:52,543 INFO L93 Difference]: Finished difference Result 2974 states and 11754 transitions. [2020-02-10 20:48:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:52,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:52,550 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:48:52,551 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:48:52,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:48:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1580. [2020-02-10 20:48:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:48:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7035 transitions. [2020-02-10 20:48:52,617 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7035 transitions. Word has length 28 [2020-02-10 20:48:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:52,617 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7035 transitions. [2020-02-10 20:48:52,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7035 transitions. [2020-02-10 20:48:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:52,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:52,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:52,619 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:52,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1306744398, now seen corresponding path program 598 times [2020-02-10 20:48:52,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:52,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430146142] [2020-02-10 20:48:52,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:53,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430146142] [2020-02-10 20:48:53,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:53,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:53,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241538370] [2020-02-10 20:48:53,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:53,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:53,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:53,149 INFO L87 Difference]: Start difference. First operand 1580 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:48:53,353 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-02-10 20:48:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:53,371 INFO L93 Difference]: Finished difference Result 2973 states and 11745 transitions. [2020-02-10 20:48:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:53,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:53,379 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:48:53,379 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:48:53,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:48:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1573. [2020-02-10 20:48:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:48:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7018 transitions. [2020-02-10 20:48:53,445 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7018 transitions. Word has length 28 [2020-02-10 20:48:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:53,445 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7018 transitions. [2020-02-10 20:48:53,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7018 transitions. [2020-02-10 20:48:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:53,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:53,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:53,448 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:53,448 INFO L82 PathProgramCache]: Analyzing trace with hash 355194980, now seen corresponding path program 599 times [2020-02-10 20:48:53,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:53,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222912302] [2020-02-10 20:48:53,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:53,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222912302] [2020-02-10 20:48:53,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:53,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:53,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817074890] [2020-02-10 20:48:53,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:53,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:53,974 INFO L87 Difference]: Start difference. First operand 1573 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:48:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:54,165 INFO L93 Difference]: Finished difference Result 2963 states and 11725 transitions. [2020-02-10 20:48:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:54,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:54,173 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:48:54,173 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:48:54,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:48:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1577. [2020-02-10 20:48:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7025 transitions. [2020-02-10 20:48:54,239 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7025 transitions. Word has length 28 [2020-02-10 20:48:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:54,239 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7025 transitions. [2020-02-10 20:48:54,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7025 transitions. [2020-02-10 20:48:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:54,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:54,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] [2020-02-10 20:48:54,242 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599976, now seen corresponding path program 600 times [2020-02-10 20:48:54,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:54,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923572802] [2020-02-10 20:48:54,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:54,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923572802] [2020-02-10 20:48:54,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:54,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:54,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996993509] [2020-02-10 20:48:54,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:54,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:54,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:54,774 INFO L87 Difference]: Start difference. First operand 1577 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:48:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:55,004 INFO L93 Difference]: Finished difference Result 2966 states and 11727 transitions. [2020-02-10 20:48:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:55,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:55,011 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:48:55,011 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:48:55,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:48:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1555. [2020-02-10 20:48:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 20:48:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6981 transitions. [2020-02-10 20:48:55,077 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6981 transitions. Word has length 28 [2020-02-10 20:48:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:55,077 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6981 transitions. [2020-02-10 20:48:55,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6981 transitions. [2020-02-10 20:48:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:55,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:55,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] [2020-02-10 20:48:55,080 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash -208706742, now seen corresponding path program 601 times [2020-02-10 20:48:55,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:55,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200698452] [2020-02-10 20:48:55,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:55,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200698452] [2020-02-10 20:48:55,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:55,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:55,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521057699] [2020-02-10 20:48:55,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:55,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:55,627 INFO L87 Difference]: Start difference. First operand 1555 states and 6981 transitions. Second operand 11 states. [2020-02-10 20:48:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:55,806 INFO L93 Difference]: Finished difference Result 2994 states and 11845 transitions. [2020-02-10 20:48:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:55,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:55,814 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:48:55,814 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:48:55,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:48:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1584. [2020-02-10 20:48:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:48:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7085 transitions. [2020-02-10 20:48:55,882 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7085 transitions. Word has length 28 [2020-02-10 20:48:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:55,883 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7085 transitions. [2020-02-10 20:48:55,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7085 transitions. [2020-02-10 20:48:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:55,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:55,885 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:55,885 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 535995756, now seen corresponding path program 602 times [2020-02-10 20:48:55,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:55,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378567644] [2020-02-10 20:48:55,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:56,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378567644] [2020-02-10 20:48:56,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:56,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796233148] [2020-02-10 20:48:56,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:56,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:56,428 INFO L87 Difference]: Start difference. First operand 1584 states and 7085 transitions. Second operand 11 states. [2020-02-10 20:48:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:56,577 INFO L93 Difference]: Finished difference Result 2998 states and 11846 transitions. [2020-02-10 20:48:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:56,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:56,584 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:48:56,585 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:48:56,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:48:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1577. [2020-02-10 20:48:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7065 transitions. [2020-02-10 20:48:56,655 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7065 transitions. Word has length 28 [2020-02-10 20:48:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:56,655 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7065 transitions. [2020-02-10 20:48:56,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7065 transitions. [2020-02-10 20:48:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:56,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:56,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] [2020-02-10 20:48:56,658 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1402234216, now seen corresponding path program 603 times [2020-02-10 20:48:56,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:56,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152158893] [2020-02-10 20:48:56,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:57,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152158893] [2020-02-10 20:48:57,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:57,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:57,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929111953] [2020-02-10 20:48:57,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:57,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:57,201 INFO L87 Difference]: Start difference. First operand 1577 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:48:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:57,382 INFO L93 Difference]: Finished difference Result 2991 states and 11833 transitions. [2020-02-10 20:48:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:57,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:57,390 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:48:57,390 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:48:57,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:48:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1583. [2020-02-10 20:48:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:48:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7076 transitions. [2020-02-10 20:48:57,457 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7076 transitions. Word has length 28 [2020-02-10 20:48:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:57,458 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7076 transitions. [2020-02-10 20:48:57,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7076 transitions. [2020-02-10 20:48:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:57,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:57,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:57,460 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1403328084, now seen corresponding path program 604 times [2020-02-10 20:48:57,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:57,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847264814] [2020-02-10 20:48:57,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:57,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847264814] [2020-02-10 20:48:57,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:57,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:57,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842802390] [2020-02-10 20:48:57,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:57,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:57,981 INFO L87 Difference]: Start difference. First operand 1583 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:48:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:58,162 INFO L93 Difference]: Finished difference Result 2993 states and 11831 transitions. [2020-02-10 20:48:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:58,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:58,169 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:48:58,169 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:48:58,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:48:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1577. [2020-02-10 20:48:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:48:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7059 transitions. [2020-02-10 20:48:58,237 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7059 transitions. Word has length 28 [2020-02-10 20:48:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:58,237 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7059 transitions. [2020-02-10 20:48:58,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7059 transitions. [2020-02-10 20:48:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:58,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:58,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:58,240 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash -537089624, now seen corresponding path program 605 times [2020-02-10 20:48:58,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:58,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174106247] [2020-02-10 20:48:58,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:58,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174106247] [2020-02-10 20:48:58,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:58,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:58,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705921325] [2020-02-10 20:48:58,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:58,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:58,790 INFO L87 Difference]: Start difference. First operand 1577 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:48:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:58,932 INFO L93 Difference]: Finished difference Result 3003 states and 11850 transitions. [2020-02-10 20:48:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:58,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:58,941 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:48:58,941 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:48:58,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:48:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1587. [2020-02-10 20:48:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:48:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7076 transitions. [2020-02-10 20:48:59,007 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7076 transitions. Word has length 28 [2020-02-10 20:48:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:59,008 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7076 transitions. [2020-02-10 20:48:59,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7076 transitions. [2020-02-10 20:48:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:59,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:59,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:59,010 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash 207612874, now seen corresponding path program 606 times [2020-02-10 20:48:59,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:59,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189734262] [2020-02-10 20:48:59,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:59,542 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:48:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:59,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189734262] [2020-02-10 20:48:59,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:59,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:48:59,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406857473] [2020-02-10 20:48:59,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:48:59,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:59,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:48:59,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:59,571 INFO L87 Difference]: Start difference. First operand 1587 states and 7076 transitions. Second operand 11 states. [2020-02-10 20:48:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:59,769 INFO L93 Difference]: Finished difference Result 3001 states and 11838 transitions. [2020-02-10 20:48:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:48:59,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:48:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:59,776 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:48:59,777 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:48:59,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:48:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:48:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1569. [2020-02-10 20:48:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:48:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7038 transitions. [2020-02-10 20:48:59,843 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7038 transitions. Word has length 28 [2020-02-10 20:48:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:59,843 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7038 transitions. [2020-02-10 20:48:59,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:48:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7038 transitions. [2020-02-10 20:48:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:48:59,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:59,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:59,845 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:48:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -715053008, now seen corresponding path program 607 times [2020-02-10 20:48:59,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:59,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048203961] [2020-02-10 20:48:59,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:00,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048203961] [2020-02-10 20:49:00,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:00,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:00,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62532861] [2020-02-10 20:49:00,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:00,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:00,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:00,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:00,380 INFO L87 Difference]: Start difference. First operand 1569 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:49:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:00,555 INFO L93 Difference]: Finished difference Result 2980 states and 11802 transitions. [2020-02-10 20:49:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:00,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:00,563 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:49:00,564 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:49:00,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:49:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1581. [2020-02-10 20:49:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:49:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7069 transitions. [2020-02-10 20:49:00,630 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7069 transitions. Word has length 28 [2020-02-10 20:49:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:00,630 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7069 transitions. [2020-02-10 20:49:00,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7069 transitions. [2020-02-10 20:49:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:00,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:00,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] [2020-02-10 20:49:00,632 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:00,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash 29649490, now seen corresponding path program 608 times [2020-02-10 20:49:00,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:00,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445732044] [2020-02-10 20:49:00,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:01,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445732044] [2020-02-10 20:49:01,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:01,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:01,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289826760] [2020-02-10 20:49:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:01,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:01,173 INFO L87 Difference]: Start difference. First operand 1581 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:49:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:01,316 INFO L93 Difference]: Finished difference Result 2984 states and 11803 transitions. [2020-02-10 20:49:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:01,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:01,324 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:49:01,325 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:49:01,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:49:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1574. [2020-02-10 20:49:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:49:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7051 transitions. [2020-02-10 20:49:01,393 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7051 transitions. Word has length 28 [2020-02-10 20:49:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:01,393 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7051 transitions. [2020-02-10 20:49:01,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7051 transitions. [2020-02-10 20:49:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:01,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:01,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:01,395 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:01,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:01,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1433743528, now seen corresponding path program 609 times [2020-02-10 20:49:01,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:01,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594379556] [2020-02-10 20:49:01,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:01,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594379556] [2020-02-10 20:49:01,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:01,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:01,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093066840] [2020-02-10 20:49:01,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:01,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:01,911 INFO L87 Difference]: Start difference. First operand 1574 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:49:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:02,083 INFO L93 Difference]: Finished difference Result 2971 states and 11778 transitions. [2020-02-10 20:49:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:02,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:02,090 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:49:02,091 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:49:02,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:49:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1578. [2020-02-10 20:49:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:49:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7058 transitions. [2020-02-10 20:49:02,159 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7058 transitions. Word has length 28 [2020-02-10 20:49:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:02,159 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7058 transitions. [2020-02-10 20:49:02,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7058 transitions. [2020-02-10 20:49:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:02,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:02,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] [2020-02-10 20:49:02,161 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 862288722, now seen corresponding path program 610 times [2020-02-10 20:49:02,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:02,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531517869] [2020-02-10 20:49:02,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:02,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531517869] [2020-02-10 20:49:02,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:02,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:02,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799812947] [2020-02-10 20:49:02,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:02,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:02,686 INFO L87 Difference]: Start difference. First operand 1578 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:49:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:02,879 INFO L93 Difference]: Finished difference Result 2969 states and 11770 transitions. [2020-02-10 20:49:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:02,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:02,887 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:49:02,888 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:49:02,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:49:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1574. [2020-02-10 20:49:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:49:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7047 transitions. [2020-02-10 20:49:02,954 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7047 transitions. Word has length 28 [2020-02-10 20:49:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:02,954 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7047 transitions. [2020-02-10 20:49:02,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7047 transitions. [2020-02-10 20:49:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:02,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:02,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:02,957 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash -505580312, now seen corresponding path program 611 times [2020-02-10 20:49:02,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:02,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130032280] [2020-02-10 20:49:02,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:03,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130032280] [2020-02-10 20:49:03,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:03,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:03,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275280003] [2020-02-10 20:49:03,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:03,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:03,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:03,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:03,483 INFO L87 Difference]: Start difference. First operand 1574 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:49:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:03,628 INFO L93 Difference]: Finished difference Result 2980 states and 11790 transitions. [2020-02-10 20:49:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:03,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:03,636 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:49:03,636 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:49:03,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:49:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1579. [2020-02-10 20:49:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:49:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7055 transitions. [2020-02-10 20:49:03,704 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7055 transitions. Word has length 28 [2020-02-10 20:49:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:03,704 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7055 transitions. [2020-02-10 20:49:03,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7055 transitions. [2020-02-10 20:49:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:03,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:03,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:03,706 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:03,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:03,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1821737616, now seen corresponding path program 612 times [2020-02-10 20:49:03,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:03,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294227265] [2020-02-10 20:49:03,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:04,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294227265] [2020-02-10 20:49:04,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:04,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:04,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022474076] [2020-02-10 20:49:04,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:04,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:04,228 INFO L87 Difference]: Start difference. First operand 1579 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:49:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:04,403 INFO L93 Difference]: Finished difference Result 2974 states and 11774 transitions. [2020-02-10 20:49:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:04,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:04,410 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:49:04,411 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:49:04,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:49:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1569. [2020-02-10 20:49:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:49:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7033 transitions. [2020-02-10 20:49:04,479 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7033 transitions. Word has length 28 [2020-02-10 20:49:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:04,479 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7033 transitions. [2020-02-10 20:49:04,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7033 transitions. [2020-02-10 20:49:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:04,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:04,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:04,482 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -704549904, now seen corresponding path program 613 times [2020-02-10 20:49:04,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:04,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396540716] [2020-02-10 20:49:04,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:05,001 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:05,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396540716] [2020-02-10 20:49:05,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:05,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:05,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771376163] [2020-02-10 20:49:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:05,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:05,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:05,009 INFO L87 Difference]: Start difference. First operand 1569 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:49:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:05,181 INFO L93 Difference]: Finished difference Result 2972 states and 11782 transitions. [2020-02-10 20:49:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:05,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:05,189 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:49:05,189 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:49:05,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:49:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1579. [2020-02-10 20:49:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:49:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7059 transitions. [2020-02-10 20:49:05,256 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7059 transitions. Word has length 28 [2020-02-10 20:49:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:05,257 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7059 transitions. [2020-02-10 20:49:05,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7059 transitions. [2020-02-10 20:49:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:05,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:05,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] [2020-02-10 20:49:05,259 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash 784855092, now seen corresponding path program 614 times [2020-02-10 20:49:05,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:05,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36399160] [2020-02-10 20:49:05,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:05,800 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:05,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36399160] [2020-02-10 20:49:05,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:05,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:05,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354786765] [2020-02-10 20:49:05,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:05,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:05,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:05,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:05,808 INFO L87 Difference]: Start difference. First operand 1579 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:49:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:05,985 INFO L93 Difference]: Finished difference Result 2974 states and 11780 transitions. [2020-02-10 20:49:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:05,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:05,992 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:49:05,992 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:49:05,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:49:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1573. [2020-02-10 20:49:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:49:06,058 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:49:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:06,058 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:49:06,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:49:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:06,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:06,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] [2020-02-10 20:49:06,061 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -166694326, now seen corresponding path program 615 times [2020-02-10 20:49:06,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:06,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160777129] [2020-02-10 20:49:06,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:06,586 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:06,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160777129] [2020-02-10 20:49:06,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:06,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:06,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151770291] [2020-02-10 20:49:06,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:06,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:06,593 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:49:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:06,790 INFO L93 Difference]: Finished difference Result 2966 states and 11764 transitions. [2020-02-10 20:49:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:06,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:06,797 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:49:06,798 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:49:06,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:49:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1577. [2020-02-10 20:49:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:49:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7051 transitions. [2020-02-10 20:49:06,865 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7051 transitions. Word has length 28 [2020-02-10 20:49:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:06,865 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7051 transitions. [2020-02-10 20:49:06,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7051 transitions. [2020-02-10 20:49:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:06,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:06,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:06,868 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash -738149132, now seen corresponding path program 616 times [2020-02-10 20:49:06,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:06,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932632398] [2020-02-10 20:49:06,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:07,377 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932632398] [2020-02-10 20:49:07,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:07,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:07,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695326866] [2020-02-10 20:49:07,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:07,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:07,384 INFO L87 Difference]: Start difference. First operand 1577 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:49:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:07,607 INFO L93 Difference]: Finished difference Result 2964 states and 11756 transitions. [2020-02-10 20:49:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:07,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:07,614 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:49:07,614 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:49:07,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:49:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1573. [2020-02-10 20:49:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 20:49:07,680 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 20:49:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:07,680 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 20:49:07,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 20:49:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:07,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:07,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:07,683 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash 249625290, now seen corresponding path program 617 times [2020-02-10 20:49:07,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:07,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486165331] [2020-02-10 20:49:07,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:08,213 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:08,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486165331] [2020-02-10 20:49:08,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:08,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:08,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584341825] [2020-02-10 20:49:08,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:08,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:08,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:08,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:08,220 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:49:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:08,418 INFO L93 Difference]: Finished difference Result 2970 states and 11768 transitions. [2020-02-10 20:49:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:08,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:08,426 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:49:08,426 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:49:08,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:49:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1577. [2020-02-10 20:49:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:49:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 20:49:08,494 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 20:49:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:08,494 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 20:49:08,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 20:49:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:08,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:08,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:08,497 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1811234512, now seen corresponding path program 618 times [2020-02-10 20:49:08,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:08,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384499538] [2020-02-10 20:49:08,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:09,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384499538] [2020-02-10 20:49:09,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:09,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:09,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599966504] [2020-02-10 20:49:09,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:09,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:09,021 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:49:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:09,216 INFO L93 Difference]: Finished difference Result 2966 states and 11756 transitions. [2020-02-10 20:49:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:09,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:09,224 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:49:09,224 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:49:09,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:49:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1569. [2020-02-10 20:49:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:49:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7029 transitions. [2020-02-10 20:49:09,293 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7029 transitions. Word has length 28 [2020-02-10 20:49:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:09,293 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7029 transitions. [2020-02-10 20:49:09,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7029 transitions. [2020-02-10 20:49:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:09,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:09,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] [2020-02-10 20:49:09,295 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 50655698, now seen corresponding path program 619 times [2020-02-10 20:49:09,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:09,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613965586] [2020-02-10 20:49:09,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:09,834 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:09,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613965586] [2020-02-10 20:49:09,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364217222] [2020-02-10 20:49:09,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:09,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:09,842 INFO L87 Difference]: Start difference. First operand 1569 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:49:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:10,003 INFO L93 Difference]: Finished difference Result 2995 states and 11824 transitions. [2020-02-10 20:49:10,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:10,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:10,012 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:49:10,012 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:49:10,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:49:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1585. [2020-02-10 20:49:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:49:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7066 transitions. [2020-02-10 20:49:10,078 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7066 transitions. Word has length 28 [2020-02-10 20:49:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:10,078 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7066 transitions. [2020-02-10 20:49:10,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7066 transitions. [2020-02-10 20:49:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:10,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:10,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:10,081 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 795358196, now seen corresponding path program 620 times [2020-02-10 20:49:10,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:10,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831524345] [2020-02-10 20:49:10,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:10,619 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:10,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831524345] [2020-02-10 20:49:10,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:10,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:10,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060832407] [2020-02-10 20:49:10,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:10,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:10,626 INFO L87 Difference]: Start difference. First operand 1585 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:49:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:10,820 INFO L93 Difference]: Finished difference Result 2993 states and 11812 transitions. [2020-02-10 20:49:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:10,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:10,828 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:49:10,828 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 20:49:10,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 20:49:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1575. [2020-02-10 20:49:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:49:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 20:49:10,895 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 20:49:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:10,895 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 20:49:10,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 20:49:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:10,897 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:10,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:10,898 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash 588511276, now seen corresponding path program 621 times [2020-02-10 20:49:10,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:10,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517741682] [2020-02-10 20:49:10,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:11,425 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:11,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517741682] [2020-02-10 20:49:11,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:11,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:11,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302206373] [2020-02-10 20:49:11,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:11,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:11,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:11,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:11,433 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:49:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:11,564 INFO L93 Difference]: Finished difference Result 2986 states and 11797 transitions. [2020-02-10 20:49:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:11,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:11,572 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:49:11,572 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:49:11,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:49:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 20:49:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:49:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 20:49:11,638 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 20:49:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:11,638 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 20:49:11,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 20:49:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:11,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:11,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:11,641 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash -727646028, now seen corresponding path program 622 times [2020-02-10 20:49:11,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704510723] [2020-02-10 20:49:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:12,071 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:49:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:12,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704510723] [2020-02-10 20:49:12,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:12,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:12,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316275320] [2020-02-10 20:49:12,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:12,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:12,190 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:49:12,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:12,364 INFO L93 Difference]: Finished difference Result 2980 states and 11781 transitions. [2020-02-10 20:49:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:12,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:12,371 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:49:12,371 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:49:12,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:49:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:49:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:49:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7038 transitions. [2020-02-10 20:49:12,438 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7038 transitions. Word has length 28 [2020-02-10 20:49:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:12,439 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7038 transitions. [2020-02-10 20:49:12,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7038 transitions. [2020-02-10 20:49:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:12,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:12,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:12,441 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1350812564, now seen corresponding path program 623 times [2020-02-10 20:49:12,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:12,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190862691] [2020-02-10 20:49:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:12,978 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:12,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190862691] [2020-02-10 20:49:12,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:12,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:12,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052944168] [2020-02-10 20:49:12,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:12,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:12,986 INFO L87 Difference]: Start difference. First operand 1575 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:49:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:13,168 INFO L93 Difference]: Finished difference Result 2981 states and 11784 transitions. [2020-02-10 20:49:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:13,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:13,175 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:49:13,175 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:49:13,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:49:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1579. [2020-02-10 20:49:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:49:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7045 transitions. [2020-02-10 20:49:13,244 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7045 transitions. Word has length 28 [2020-02-10 20:49:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:13,244 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7045 transitions. [2020-02-10 20:49:13,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7045 transitions. [2020-02-10 20:49:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:13,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:13,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] [2020-02-10 20:49:13,247 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 883294930, now seen corresponding path program 624 times [2020-02-10 20:49:13,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:13,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768808623] [2020-02-10 20:49:13,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:13,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768808623] [2020-02-10 20:49:13,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:13,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:13,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277362869] [2020-02-10 20:49:13,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:13,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:13,791 INFO L87 Difference]: Start difference. First operand 1579 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:49:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:14,027 INFO L93 Difference]: Finished difference Result 2977 states and 11772 transitions. [2020-02-10 20:49:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:14,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:14,035 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:49:14,035 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:49:14,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:49:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1563. [2020-02-10 20:49:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:49:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7012 transitions. [2020-02-10 20:49:14,103 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7012 transitions. Word has length 28 [2020-02-10 20:49:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:14,103 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7012 transitions. [2020-02-10 20:49:14,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7012 transitions. [2020-02-10 20:49:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:14,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:14,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:14,105 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash -651605882, now seen corresponding path program 625 times [2020-02-10 20:49:14,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:14,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525578965] [2020-02-10 20:49:14,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:14,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525578965] [2020-02-10 20:49:14,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:14,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:14,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263829459] [2020-02-10 20:49:14,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:14,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:14,652 INFO L87 Difference]: Start difference. First operand 1563 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:49:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:14,849 INFO L93 Difference]: Finished difference Result 3017 states and 11911 transitions. [2020-02-10 20:49:14,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:14,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:14,857 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 20:49:14,857 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 20:49:14,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 20:49:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1588. [2020-02-10 20:49:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:49:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7092 transitions. [2020-02-10 20:49:14,924 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7092 transitions. Word has length 28 [2020-02-10 20:49:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:14,925 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7092 transitions. [2020-02-10 20:49:14,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7092 transitions. [2020-02-10 20:49:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:14,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:14,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] [2020-02-10 20:49:14,927 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash 93096616, now seen corresponding path program 626 times [2020-02-10 20:49:14,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:14,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039312318] [2020-02-10 20:49:14,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:15,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039312318] [2020-02-10 20:49:15,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:15,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335826402] [2020-02-10 20:49:15,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:15,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:15,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:15,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:15,481 INFO L87 Difference]: Start difference. First operand 1588 states and 7092 transitions. Second operand 11 states. [2020-02-10 20:49:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:15,648 INFO L93 Difference]: Finished difference Result 3021 states and 11912 transitions. [2020-02-10 20:49:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:15,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:15,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:15,656 INFO L225 Difference]: With dead ends: 3021 [2020-02-10 20:49:15,656 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:49:15,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:49:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1581. [2020-02-10 20:49:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:49:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7072 transitions. [2020-02-10 20:49:15,724 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7072 transitions. Word has length 28 [2020-02-10 20:49:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:15,724 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7072 transitions. [2020-02-10 20:49:15,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7072 transitions. [2020-02-10 20:49:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:15,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:15,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:15,727 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash 959335076, now seen corresponding path program 627 times [2020-02-10 20:49:15,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:15,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705468646] [2020-02-10 20:49:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:16,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705468646] [2020-02-10 20:49:16,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:16,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:16,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504848000] [2020-02-10 20:49:16,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:16,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:16,262 INFO L87 Difference]: Start difference. First operand 1581 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:49:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:16,467 INFO L93 Difference]: Finished difference Result 3014 states and 11899 transitions. [2020-02-10 20:49:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:16,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:16,474 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 20:49:16,474 INFO L226 Difference]: Without dead ends: 2998 [2020-02-10 20:49:16,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2020-02-10 20:49:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 1587. [2020-02-10 20:49:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:49:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7083 transitions. [2020-02-10 20:49:16,543 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7083 transitions. Word has length 28 [2020-02-10 20:49:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:16,543 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7083 transitions. [2020-02-10 20:49:16,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7083 transitions. [2020-02-10 20:49:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:16,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:16,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] [2020-02-10 20:49:16,546 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1846227224, now seen corresponding path program 628 times [2020-02-10 20:49:16,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:16,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290235871] [2020-02-10 20:49:16,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:17,082 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:17,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290235871] [2020-02-10 20:49:17,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:17,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:17,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051325435] [2020-02-10 20:49:17,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:17,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:17,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:17,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:17,090 INFO L87 Difference]: Start difference. First operand 1587 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:49:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:17,320 INFO L93 Difference]: Finished difference Result 3016 states and 11897 transitions. [2020-02-10 20:49:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:17,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:17,328 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 20:49:17,329 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 20:49:17,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 20:49:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1581. [2020-02-10 20:49:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:49:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7066 transitions. [2020-02-10 20:49:17,396 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7066 transitions. Word has length 28 [2020-02-10 20:49:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:17,396 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7066 transitions. [2020-02-10 20:49:17,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7066 transitions. [2020-02-10 20:49:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:17,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:17,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] [2020-02-10 20:49:17,398 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -979988764, now seen corresponding path program 629 times [2020-02-10 20:49:17,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:17,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251945663] [2020-02-10 20:49:17,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:17,955 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:17,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251945663] [2020-02-10 20:49:17,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:17,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:17,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011416630] [2020-02-10 20:49:17,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:17,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:17,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:17,963 INFO L87 Difference]: Start difference. First operand 1581 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:49:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:18,133 INFO L93 Difference]: Finished difference Result 3026 states and 11916 transitions. [2020-02-10 20:49:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:18,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:18,140 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 20:49:18,140 INFO L226 Difference]: Without dead ends: 3006 [2020-02-10 20:49:18,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2020-02-10 20:49:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1591. [2020-02-10 20:49:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:49:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7083 transitions. [2020-02-10 20:49:18,206 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7083 transitions. Word has length 28 [2020-02-10 20:49:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:18,207 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7083 transitions. [2020-02-10 20:49:18,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7083 transitions. [2020-02-10 20:49:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:18,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:18,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:18,209 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash -235286266, now seen corresponding path program 630 times [2020-02-10 20:49:18,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:18,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230833316] [2020-02-10 20:49:18,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:18,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230833316] [2020-02-10 20:49:18,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:18,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:18,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574421460] [2020-02-10 20:49:18,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:18,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:18,786 INFO L87 Difference]: Start difference. First operand 1591 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:49:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:18,973 INFO L93 Difference]: Finished difference Result 3024 states and 11904 transitions. [2020-02-10 20:49:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:18,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:18,981 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 20:49:18,981 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:49:18,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:49:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1573. [2020-02-10 20:49:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7043 transitions. [2020-02-10 20:49:19,046 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7043 transitions. Word has length 28 [2020-02-10 20:49:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:19,047 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7043 transitions. [2020-02-10 20:49:19,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7043 transitions. [2020-02-10 20:49:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:19,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:19,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:19,049 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -63860560, now seen corresponding path program 631 times [2020-02-10 20:49:19,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:19,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325340135] [2020-02-10 20:49:19,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:19,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325340135] [2020-02-10 20:49:19,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:19,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:19,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910966871] [2020-02-10 20:49:19,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:19,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:19,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:19,594 INFO L87 Difference]: Start difference. First operand 1573 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:49:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:19,801 INFO L93 Difference]: Finished difference Result 3013 states and 11895 transitions. [2020-02-10 20:49:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:19,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:19,808 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:49:19,809 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 20:49:19,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 20:49:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1587. [2020-02-10 20:49:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:49:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7082 transitions. [2020-02-10 20:49:19,876 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7082 transitions. Word has length 28 [2020-02-10 20:49:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:19,876 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7082 transitions. [2020-02-10 20:49:19,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7082 transitions. [2020-02-10 20:49:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:19,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:19,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:19,879 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 680841938, now seen corresponding path program 632 times [2020-02-10 20:49:19,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:19,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367217470] [2020-02-10 20:49:19,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:20,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367217470] [2020-02-10 20:49:20,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:20,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:20,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989828524] [2020-02-10 20:49:20,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:20,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:20,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:20,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:20,421 INFO L87 Difference]: Start difference. First operand 1587 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:49:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:20,567 INFO L93 Difference]: Finished difference Result 3017 states and 11896 transitions. [2020-02-10 20:49:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:20,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:20,575 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 20:49:20,576 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:49:20,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:49:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1580. [2020-02-10 20:49:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:49:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 20:49:20,643 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 20:49:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:20,643 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 20:49:20,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 20:49:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:20,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:20,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:20,646 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1011850596, now seen corresponding path program 633 times [2020-02-10 20:49:20,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:20,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335843258] [2020-02-10 20:49:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:21,189 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:21,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335843258] [2020-02-10 20:49:21,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:21,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:21,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425163657] [2020-02-10 20:49:21,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:21,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:21,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:21,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:21,198 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:49:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:21,406 INFO L93 Difference]: Finished difference Result 3009 states and 11881 transitions. [2020-02-10 20:49:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:21,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:21,414 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:49:21,415 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 20:49:21,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 20:49:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1586. [2020-02-10 20:49:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:49:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7073 transitions. [2020-02-10 20:49:21,482 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7073 transitions. Word has length 28 [2020-02-10 20:49:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:21,482 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7073 transitions. [2020-02-10 20:49:21,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7073 transitions. [2020-02-10 20:49:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:21,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:21,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:21,485 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1929800786, now seen corresponding path program 634 times [2020-02-10 20:49:21,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:21,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561592802] [2020-02-10 20:49:21,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:22,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561592802] [2020-02-10 20:49:22,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:22,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:22,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145453681] [2020-02-10 20:49:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:22,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:22,024 INFO L87 Difference]: Start difference. First operand 1586 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:49:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:22,205 INFO L93 Difference]: Finished difference Result 3010 states and 11877 transitions. [2020-02-10 20:49:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:22,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:22,212 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:49:22,212 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 20:49:22,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 20:49:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1580. [2020-02-10 20:49:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:49:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7056 transitions. [2020-02-10 20:49:22,278 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7056 transitions. Word has length 28 [2020-02-10 20:49:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:22,278 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7056 transitions. [2020-02-10 20:49:22,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7056 transitions. [2020-02-10 20:49:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:22,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:22,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] [2020-02-10 20:49:22,281 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -927473244, now seen corresponding path program 635 times [2020-02-10 20:49:22,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:22,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247627599] [2020-02-10 20:49:22,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:22,828 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:22,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247627599] [2020-02-10 20:49:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:22,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189658829] [2020-02-10 20:49:22,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:22,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:22,836 INFO L87 Difference]: Start difference. First operand 1580 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:49:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:23,029 INFO L93 Difference]: Finished difference Result 3019 states and 11894 transitions. [2020-02-10 20:49:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:23,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:23,037 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 20:49:23,037 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 20:49:23,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 20:49:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1588. [2020-02-10 20:49:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:49:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7070 transitions. [2020-02-10 20:49:23,104 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7070 transitions. Word has length 28 [2020-02-10 20:49:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:23,104 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7070 transitions. [2020-02-10 20:49:23,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7070 transitions. [2020-02-10 20:49:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:23,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:23,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] [2020-02-10 20:49:23,106 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash -754225552, now seen corresponding path program 636 times [2020-02-10 20:49:23,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:23,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794011352] [2020-02-10 20:49:23,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:23,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794011352] [2020-02-10 20:49:23,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:23,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:23,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644476443] [2020-02-10 20:49:23,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:23,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:23,653 INFO L87 Difference]: Start difference. First operand 1588 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:49:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:23,910 INFO L93 Difference]: Finished difference Result 3016 states and 11881 transitions. [2020-02-10 20:49:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:23,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:23,918 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 20:49:23,918 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:49:23,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:49:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1573. [2020-02-10 20:49:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 20:49:23,984 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 20:49:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:23,984 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 20:49:23,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 20:49:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:23,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:23,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] [2020-02-10 20:49:23,987 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash -53357456, now seen corresponding path program 637 times [2020-02-10 20:49:23,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:23,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098956058] [2020-02-10 20:49:23,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:24,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098956058] [2020-02-10 20:49:24,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:24,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:24,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487352828] [2020-02-10 20:49:24,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:24,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:24,524 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:49:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:24,789 INFO L93 Difference]: Finished difference Result 3005 states and 11873 transitions. [2020-02-10 20:49:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:24,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:24,797 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:49:24,798 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:49:24,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:49:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1585. [2020-02-10 20:49:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:49:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7070 transitions. [2020-02-10 20:49:24,887 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7070 transitions. Word has length 28 [2020-02-10 20:49:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:24,887 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7070 transitions. [2020-02-10 20:49:24,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7070 transitions. [2020-02-10 20:49:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:24,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:24,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:24,889 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1436047540, now seen corresponding path program 638 times [2020-02-10 20:49:24,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:24,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209708634] [2020-02-10 20:49:24,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:25,424 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:25,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209708634] [2020-02-10 20:49:25,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:25,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:25,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638544923] [2020-02-10 20:49:25,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:25,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:25,432 INFO L87 Difference]: Start difference. First operand 1585 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:49:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:25,645 INFO L93 Difference]: Finished difference Result 3007 states and 11871 transitions. [2020-02-10 20:49:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:25,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:25,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:25,654 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:49:25,654 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:49:25,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:49:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1579. [2020-02-10 20:49:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:49:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7053 transitions. [2020-02-10 20:49:25,721 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7053 transitions. Word has length 28 [2020-02-10 20:49:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:25,721 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7053 transitions. [2020-02-10 20:49:25,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7053 transitions. [2020-02-10 20:49:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:25,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:25,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] [2020-02-10 20:49:25,724 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash -588587258, now seen corresponding path program 639 times [2020-02-10 20:49:25,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:25,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274942271] [2020-02-10 20:49:25,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:26,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274942271] [2020-02-10 20:49:26,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:26,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:26,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958064467] [2020-02-10 20:49:26,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:26,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:26,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:26,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:26,261 INFO L87 Difference]: Start difference. First operand 1579 states and 7053 transitions. Second operand 11 states. [2020-02-10 20:49:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:26,522 INFO L93 Difference]: Finished difference Result 3004 states and 11865 transitions. [2020-02-10 20:49:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:26,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:26,530 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:49:26,530 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:49:26,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:49:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1585. [2020-02-10 20:49:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:49:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7064 transitions. [2020-02-10 20:49:26,597 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7064 transitions. Word has length 28 [2020-02-10 20:49:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:26,597 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7064 transitions. [2020-02-10 20:49:26,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7064 transitions. [2020-02-10 20:49:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:26,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:26,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:26,599 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash 329362932, now seen corresponding path program 640 times [2020-02-10 20:49:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:26,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448112697] [2020-02-10 20:49:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:27,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448112697] [2020-02-10 20:49:27,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:27,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:27,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61084170] [2020-02-10 20:49:27,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:27,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:27,136 INFO L87 Difference]: Start difference. First operand 1585 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:49:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:27,328 INFO L93 Difference]: Finished difference Result 3005 states and 11861 transitions. [2020-02-10 20:49:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:27,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:27,336 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:49:27,336 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 20:49:27,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 20:49:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1579. [2020-02-10 20:49:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:49:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7047 transitions. [2020-02-10 20:49:27,407 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7047 transitions. Word has length 28 [2020-02-10 20:49:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:27,407 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7047 transitions. [2020-02-10 20:49:27,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7047 transitions. [2020-02-10 20:49:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:27,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:27,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] [2020-02-10 20:49:27,409 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -172267642, now seen corresponding path program 641 times [2020-02-10 20:49:27,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:27,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475285714] [2020-02-10 20:49:27,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:27,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475285714] [2020-02-10 20:49:27,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:27,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:27,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126626236] [2020-02-10 20:49:27,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:27,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:27,962 INFO L87 Difference]: Start difference. First operand 1579 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:49:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:28,161 INFO L93 Difference]: Finished difference Result 3009 states and 11870 transitions. [2020-02-10 20:49:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:28,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:28,169 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:49:28,169 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:49:28,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:49:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1586. [2020-02-10 20:49:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:49:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7060 transitions. [2020-02-10 20:49:28,235 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7060 transitions. Word has length 28 [2020-02-10 20:49:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:28,235 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7060 transitions. [2020-02-10 20:49:28,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7060 transitions. [2020-02-10 20:49:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:28,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:28,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:28,238 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -743722448, now seen corresponding path program 642 times [2020-02-10 20:49:28,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:28,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913955956] [2020-02-10 20:49:28,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:28,786 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:49:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:28,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913955956] [2020-02-10 20:49:28,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:28,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:28,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089577013] [2020-02-10 20:49:28,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:28,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:28,794 INFO L87 Difference]: Start difference. First operand 1586 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:49:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:28,993 INFO L93 Difference]: Finished difference Result 3008 states and 11861 transitions. [2020-02-10 20:49:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:28,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:29,000 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:49:29,000 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:49:29,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:49:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1573. [2020-02-10 20:49:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7030 transitions. [2020-02-10 20:49:29,066 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7030 transitions. Word has length 28 [2020-02-10 20:49:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:29,066 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7030 transitions. [2020-02-10 20:49:29,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7030 transitions. [2020-02-10 20:49:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:29,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:29,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] [2020-02-10 20:49:29,069 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 701848146, now seen corresponding path program 643 times [2020-02-10 20:49:29,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:29,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417993411] [2020-02-10 20:49:29,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:29,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417993411] [2020-02-10 20:49:29,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:29,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:29,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604663690] [2020-02-10 20:49:29,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:29,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:29,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:29,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:29,641 INFO L87 Difference]: Start difference. First operand 1573 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:49:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:29,864 INFO L93 Difference]: Finished difference Result 3031 states and 11921 transitions. [2020-02-10 20:49:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:29,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:29,872 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 20:49:29,872 INFO L226 Difference]: Without dead ends: 3011 [2020-02-10 20:49:29,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-02-10 20:49:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1593. [2020-02-10 20:49:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:49:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7080 transitions. [2020-02-10 20:49:29,943 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7080 transitions. Word has length 28 [2020-02-10 20:49:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:29,943 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7080 transitions. [2020-02-10 20:49:29,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7080 transitions. [2020-02-10 20:49:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:29,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:29,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:29,946 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1446550644, now seen corresponding path program 644 times [2020-02-10 20:49:29,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:29,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478608418] [2020-02-10 20:49:29,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:30,509 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:49:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:30,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478608418] [2020-02-10 20:49:30,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:30,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:30,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728390558] [2020-02-10 20:49:30,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:30,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:30,517 INFO L87 Difference]: Start difference. First operand 1593 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:49:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:30,723 INFO L93 Difference]: Finished difference Result 3029 states and 11909 transitions. [2020-02-10 20:49:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:30,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:30,730 INFO L225 Difference]: With dead ends: 3029 [2020-02-10 20:49:30,730 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 20:49:30,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 20:49:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1583. [2020-02-10 20:49:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:49:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7054 transitions. [2020-02-10 20:49:30,798 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7054 transitions. Word has length 28 [2020-02-10 20:49:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:30,798 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7054 transitions. [2020-02-10 20:49:30,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7054 transitions. [2020-02-10 20:49:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:30,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:30,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:30,801 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash 166618344, now seen corresponding path program 645 times [2020-02-10 20:49:30,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:30,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658212450] [2020-02-10 20:49:30,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:31,381 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:31,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 20:49:31,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658212450] [2020-02-10 20:49:31,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:31,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:31,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140013760] [2020-02-10 20:49:31,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:31,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:31,389 INFO L87 Difference]: Start difference. First operand 1583 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:49:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:31,556 INFO L93 Difference]: Finished difference Result 3028 states and 11906 transitions. [2020-02-10 20:49:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:31,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:31,564 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 20:49:31,564 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 20:49:31,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 20:49:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1591. [2020-02-10 20:49:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:49:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7068 transitions. [2020-02-10 20:49:31,632 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7068 transitions. Word has length 28 [2020-02-10 20:49:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:31,632 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7068 transitions. [2020-02-10 20:49:31,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7068 transitions. [2020-02-10 20:49:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:31,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:31,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:31,634 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:31,634 INFO L82 PathProgramCache]: Analyzing trace with hash 339866036, now seen corresponding path program 646 times [2020-02-10 20:49:31,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:31,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947190116] [2020-02-10 20:49:31,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:32,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947190116] [2020-02-10 20:49:32,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:32,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:32,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786486608] [2020-02-10 20:49:32,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:32,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:32,189 INFO L87 Difference]: Start difference. First operand 1591 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:49:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:32,382 INFO L93 Difference]: Finished difference Result 3025 states and 11893 transitions. [2020-02-10 20:49:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:32,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:32,390 INFO L225 Difference]: With dead ends: 3025 [2020-02-10 20:49:32,390 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 20:49:32,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 20:49:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1583. [2020-02-10 20:49:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:49:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7046 transitions. [2020-02-10 20:49:32,457 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7046 transitions. Word has length 28 [2020-02-10 20:49:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:32,457 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7046 transitions. [2020-02-10 20:49:32,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7046 transitions. [2020-02-10 20:49:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:32,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:32,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:32,459 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1772705496, now seen corresponding path program 647 times [2020-02-10 20:49:32,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:32,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884297169] [2020-02-10 20:49:32,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:33,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884297169] [2020-02-10 20:49:33,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:33,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:33,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81437293] [2020-02-10 20:49:33,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:33,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:33,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:33,021 INFO L87 Difference]: Start difference. First operand 1583 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:49:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:33,193 INFO L93 Difference]: Finished difference Result 3023 states and 11890 transitions. [2020-02-10 20:49:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:33,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:33,200 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 20:49:33,200 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 20:49:33,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 20:49:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1590. [2020-02-10 20:49:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:49:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7059 transitions. [2020-02-10 20:49:33,267 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7059 transitions. Word has length 28 [2020-02-10 20:49:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:33,267 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7059 transitions. [2020-02-10 20:49:33,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7059 transitions. [2020-02-10 20:49:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:33,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:33,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:33,269 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1950806994, now seen corresponding path program 648 times [2020-02-10 20:49:33,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:33,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543872554] [2020-02-10 20:49:33,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:33,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543872554] [2020-02-10 20:49:33,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:33,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:33,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098383852] [2020-02-10 20:49:33,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:33,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:33,834 INFO L87 Difference]: Start difference. First operand 1590 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:49:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:34,013 INFO L93 Difference]: Finished difference Result 3022 states and 11881 transitions. [2020-02-10 20:49:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:34,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:34,021 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 20:49:34,021 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:49:34,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:49:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1563. [2020-02-10 20:49:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:49:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7004 transitions. [2020-02-10 20:49:34,089 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7004 transitions. Word has length 28 [2020-02-10 20:49:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:34,089 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7004 transitions. [2020-02-10 20:49:34,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7004 transitions. [2020-02-10 20:49:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:34,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:34,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] [2020-02-10 20:49:34,092 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 325182790, now seen corresponding path program 649 times [2020-02-10 20:49:34,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:34,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431541866] [2020-02-10 20:49:34,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:34,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431541866] [2020-02-10 20:49:34,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:34,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:34,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850241025] [2020-02-10 20:49:34,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:34,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:34,604 INFO L87 Difference]: Start difference. First operand 1563 states and 7004 transitions. Second operand 11 states. [2020-02-10 20:49:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:34,769 INFO L93 Difference]: Finished difference Result 2974 states and 11781 transitions. [2020-02-10 20:49:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:34,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:34,776 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:49:34,776 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:49:34,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:49:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1580. [2020-02-10 20:49:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:49:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7058 transitions. [2020-02-10 20:49:34,844 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7058 transitions. Word has length 28 [2020-02-10 20:49:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:34,844 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7058 transitions. [2020-02-10 20:49:34,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7058 transitions. [2020-02-10 20:49:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:34,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:34,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:34,846 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:34,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1069885288, now seen corresponding path program 650 times [2020-02-10 20:49:34,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:34,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557289519] [2020-02-10 20:49:34,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:35,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557289519] [2020-02-10 20:49:35,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:35,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:35,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644998253] [2020-02-10 20:49:35,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:35,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:35,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:35,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:35,371 INFO L87 Difference]: Start difference. First operand 1580 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:49:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:35,512 INFO L93 Difference]: Finished difference Result 2978 states and 11782 transitions. [2020-02-10 20:49:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:35,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:35,519 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:49:35,519 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:49:35,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:49:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1573. [2020-02-10 20:49:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 20:49:35,587 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 20:49:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:35,587 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 20:49:35,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 20:49:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:35,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:35,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] [2020-02-10 20:49:35,590 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:35,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1820987970, now seen corresponding path program 651 times [2020-02-10 20:49:35,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:35,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855257632] [2020-02-10 20:49:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:36,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855257632] [2020-02-10 20:49:36,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:36,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:36,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603317017] [2020-02-10 20:49:36,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:36,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:36,096 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:49:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:36,282 INFO L93 Difference]: Finished difference Result 2965 states and 11757 transitions. [2020-02-10 20:49:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:36,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:36,289 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:49:36,289 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 20:49:36,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 20:49:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1577. [2020-02-10 20:49:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:49:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 20:49:36,354 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 20:49:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:36,355 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 20:49:36,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 20:49:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:36,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:36,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] [2020-02-10 20:49:36,357 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1902524520, now seen corresponding path program 652 times [2020-02-10 20:49:36,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:36,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081359172] [2020-02-10 20:49:36,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:36,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081359172] [2020-02-10 20:49:36,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:36,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:36,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716481946] [2020-02-10 20:49:36,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:36,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:36,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:36,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:36,884 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:49:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:37,063 INFO L93 Difference]: Finished difference Result 2963 states and 11749 transitions. [2020-02-10 20:49:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:37,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:37,070 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:49:37,070 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:49:37,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:49:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1573. [2020-02-10 20:49:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 20:49:37,137 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 20:49:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:37,138 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 20:49:37,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 20:49:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:37,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:37,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:37,140 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash 534655486, now seen corresponding path program 653 times [2020-02-10 20:49:37,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:37,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218984212] [2020-02-10 20:49:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:37,681 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:37,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218984212] [2020-02-10 20:49:37,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:37,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:37,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990985687] [2020-02-10 20:49:37,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:37,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:37,688 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:49:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:37,824 INFO L93 Difference]: Finished difference Result 2974 states and 11769 transitions. [2020-02-10 20:49:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:37,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:37,831 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:49:37,831 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:49:37,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:49:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1578. [2020-02-10 20:49:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:49:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7044 transitions. [2020-02-10 20:49:37,900 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7044 transitions. Word has length 28 [2020-02-10 20:49:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:37,900 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7044 transitions. [2020-02-10 20:49:37,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7044 transitions. [2020-02-10 20:49:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:37,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:37,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:37,903 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:37,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash -781501818, now seen corresponding path program 654 times [2020-02-10 20:49:37,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:37,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376012479] [2020-02-10 20:49:37,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:38,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376012479] [2020-02-10 20:49:38,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:38,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:38,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981305154] [2020-02-10 20:49:38,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:38,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:38,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:38,400 INFO L87 Difference]: Start difference. First operand 1578 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:49:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:38,571 INFO L93 Difference]: Finished difference Result 2968 states and 11753 transitions. [2020-02-10 20:49:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:38,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:38,579 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:49:38,579 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:49:38,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:49:38,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1568. [2020-02-10 20:49:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:49:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7022 transitions. [2020-02-10 20:49:38,645 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7022 transitions. Word has length 28 [2020-02-10 20:49:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:38,645 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7022 transitions. [2020-02-10 20:49:38,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7022 transitions. [2020-02-10 20:49:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:38,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:38,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] [2020-02-10 20:49:38,648 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:38,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:38,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1419274378, now seen corresponding path program 655 times [2020-02-10 20:49:38,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:38,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73095843] [2020-02-10 20:49:38,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:39,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73095843] [2020-02-10 20:49:39,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:39,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:39,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101041332] [2020-02-10 20:49:39,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:39,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:39,169 INFO L87 Difference]: Start difference. First operand 1568 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:49:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:39,345 INFO L93 Difference]: Finished difference Result 2984 states and 11805 transitions. [2020-02-10 20:49:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:39,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:39,353 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:49:39,353 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:49:39,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:49:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1582. [2020-02-10 20:49:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:49:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7061 transitions. [2020-02-10 20:49:39,425 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7061 transitions. Word has length 28 [2020-02-10 20:49:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:39,425 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7061 transitions. [2020-02-10 20:49:39,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7061 transitions. [2020-02-10 20:49:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:39,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:39,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:39,428 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2130990420, now seen corresponding path program 656 times [2020-02-10 20:49:39,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:39,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501075390] [2020-02-10 20:49:39,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:39,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501075390] [2020-02-10 20:49:39,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:39,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:39,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475032911] [2020-02-10 20:49:39,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:39,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:39,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:39,976 INFO L87 Difference]: Start difference. First operand 1582 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:49:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:40,120 INFO L93 Difference]: Finished difference Result 2988 states and 11806 transitions. [2020-02-10 20:49:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:40,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:40,128 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:49:40,128 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:49:40,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:49:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 20:49:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:49:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 20:49:40,200 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 20:49:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:40,200 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 20:49:40,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 20:49:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:40,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:40,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] [2020-02-10 20:49:40,202 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1799981762, now seen corresponding path program 657 times [2020-02-10 20:49:40,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:40,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559300021] [2020-02-10 20:49:40,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:40,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559300021] [2020-02-10 20:49:40,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:40,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:40,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010579247] [2020-02-10 20:49:40,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:40,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:40,732 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:49:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:40,911 INFO L93 Difference]: Finished difference Result 2980 states and 11791 transitions. [2020-02-10 20:49:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:40,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:40,919 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:49:40,919 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:49:40,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:49:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1581. [2020-02-10 20:49:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:49:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7052 transitions. [2020-02-10 20:49:40,986 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7052 transitions. Word has length 28 [2020-02-10 20:49:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:40,986 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7052 transitions. [2020-02-10 20:49:40,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7052 transitions. [2020-02-10 20:49:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:40,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:40,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:40,988 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:40,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:40,989 INFO L82 PathProgramCache]: Analyzing trace with hash -882031572, now seen corresponding path program 658 times [2020-02-10 20:49:40,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:40,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450579201] [2020-02-10 20:49:40,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:41,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450579201] [2020-02-10 20:49:41,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:41,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:41,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381482150] [2020-02-10 20:49:41,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:41,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:41,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:41,509 INFO L87 Difference]: Start difference. First operand 1581 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:49:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:41,683 INFO L93 Difference]: Finished difference Result 2981 states and 11787 transitions. [2020-02-10 20:49:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:41,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:41,691 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:49:41,691 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:49:41,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:49:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1575. [2020-02-10 20:49:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:49:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7035 transitions. [2020-02-10 20:49:41,757 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7035 transitions. Word has length 28 [2020-02-10 20:49:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:41,757 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7035 transitions. [2020-02-10 20:49:41,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7035 transitions. [2020-02-10 20:49:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:41,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:41,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:41,760 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 555661694, now seen corresponding path program 659 times [2020-02-10 20:49:41,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:41,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898495290] [2020-02-10 20:49:41,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:42,291 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:42,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898495290] [2020-02-10 20:49:42,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:42,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:42,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026412517] [2020-02-10 20:49:42,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:42,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:42,299 INFO L87 Difference]: Start difference. First operand 1575 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:49:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:42,439 INFO L93 Difference]: Finished difference Result 2990 states and 11804 transitions. [2020-02-10 20:49:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:42,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:42,447 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:49:42,447 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:49:42,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:49:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1583. [2020-02-10 20:49:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:49:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7049 transitions. [2020-02-10 20:49:42,514 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7049 transitions. Word has length 28 [2020-02-10 20:49:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:42,514 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7049 transitions. [2020-02-10 20:49:42,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7049 transitions. [2020-02-10 20:49:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:42,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:42,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:42,516 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 728909386, now seen corresponding path program 660 times [2020-02-10 20:49:42,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:42,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190878987] [2020-02-10 20:49:42,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:43,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190878987] [2020-02-10 20:49:43,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:43,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:43,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299895054] [2020-02-10 20:49:43,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:43,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:43,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:43,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:43,109 INFO L87 Difference]: Start difference. First operand 1583 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:49:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:43,283 INFO L93 Difference]: Finished difference Result 2987 states and 11791 transitions. [2020-02-10 20:49:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:43,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:43,291 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:49:43,291 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:49:43,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:49:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1568. [2020-02-10 20:49:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:49:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7017 transitions. [2020-02-10 20:49:43,357 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7017 transitions. Word has length 28 [2020-02-10 20:49:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:43,358 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7017 transitions. [2020-02-10 20:49:43,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7017 transitions. [2020-02-10 20:49:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:43,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:43,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:43,360 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1461286794, now seen corresponding path program 661 times [2020-02-10 20:49:43,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:43,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220434298] [2020-02-10 20:49:43,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:43,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220434298] [2020-02-10 20:49:43,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:43,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:43,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14426641] [2020-02-10 20:49:43,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:43,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:43,880 INFO L87 Difference]: Start difference. First operand 1568 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:49:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:44,078 INFO L93 Difference]: Finished difference Result 2959 states and 11740 transitions. [2020-02-10 20:49:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:44,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:44,085 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:49:44,086 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:49:44,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:49:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1576. [2020-02-10 20:49:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:49:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7039 transitions. [2020-02-10 20:49:44,151 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7039 transitions. Word has length 28 [2020-02-10 20:49:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:44,151 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7039 transitions. [2020-02-10 20:49:44,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7039 transitions. [2020-02-10 20:49:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:44,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:44,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:44,154 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 889831988, now seen corresponding path program 662 times [2020-02-10 20:49:44,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:44,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991569362] [2020-02-10 20:49:44,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:44,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991569362] [2020-02-10 20:49:44,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:44,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:44,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763381352] [2020-02-10 20:49:44,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:44,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:44,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:44,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:44,663 INFO L87 Difference]: Start difference. First operand 1576 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:49:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:44,858 INFO L93 Difference]: Finished difference Result 2957 states and 11732 transitions. [2020-02-10 20:49:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:44,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:44,866 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:49:44,866 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:49:44,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:49:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1572. [2020-02-10 20:49:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:49:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7028 transitions. [2020-02-10 20:49:44,933 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7028 transitions. Word has length 28 [2020-02-10 20:49:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:44,933 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7028 transitions. [2020-02-10 20:49:44,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7028 transitions. [2020-02-10 20:49:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:44,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:44,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:44,936 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash 388201414, now seen corresponding path program 663 times [2020-02-10 20:49:44,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:44,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935371002] [2020-02-10 20:49:44,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:45,457 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:45,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935371002] [2020-02-10 20:49:45,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:45,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:45,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880375459] [2020-02-10 20:49:45,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:45,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:45,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:45,465 INFO L87 Difference]: Start difference. First operand 1572 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:49:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:45,645 INFO L93 Difference]: Finished difference Result 2964 states and 11748 transitions. [2020-02-10 20:49:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:45,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:45,653 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:49:45,653 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:49:45,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:49:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 20:49:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:49:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7039 transitions. [2020-02-10 20:49:45,720 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7039 transitions. Word has length 28 [2020-02-10 20:49:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:45,720 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7039 transitions. [2020-02-10 20:49:45,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7039 transitions. [2020-02-10 20:49:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:45,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:45,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] [2020-02-10 20:49:45,723 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1306151604, now seen corresponding path program 664 times [2020-02-10 20:49:45,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:45,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182272419] [2020-02-10 20:49:45,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:46,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182272419] [2020-02-10 20:49:46,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:46,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:46,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208157883] [2020-02-10 20:49:46,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:46,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:46,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:46,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:46,250 INFO L87 Difference]: Start difference. First operand 1578 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:49:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:46,428 INFO L93 Difference]: Finished difference Result 2965 states and 11744 transitions. [2020-02-10 20:49:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:46,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:46,436 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:49:46,436 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:49:46,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:49:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1572. [2020-02-10 20:49:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:49:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7024 transitions. [2020-02-10 20:49:46,503 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7024 transitions. Word has length 28 [2020-02-10 20:49:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:46,503 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7024 transitions. [2020-02-10 20:49:46,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7024 transitions. [2020-02-10 20:49:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:46,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:46,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:46,506 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -718483194, now seen corresponding path program 665 times [2020-02-10 20:49:46,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:46,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473148091] [2020-02-10 20:49:46,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:47,020 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:47,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473148091] [2020-02-10 20:49:47,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:47,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:47,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899741644] [2020-02-10 20:49:47,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:47,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:47,028 INFO L87 Difference]: Start difference. First operand 1572 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:49:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:47,211 INFO L93 Difference]: Finished difference Result 2958 states and 11730 transitions. [2020-02-10 20:49:47,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:47,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:47,219 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:49:47,219 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:49:47,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:49:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1576. [2020-02-10 20:49:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:49:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7031 transitions. [2020-02-10 20:49:47,285 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7031 transitions. Word has length 28 [2020-02-10 20:49:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:47,285 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7031 transitions. [2020-02-10 20:49:47,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7031 transitions. [2020-02-10 20:49:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:47,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:47,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:47,288 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:47,288 INFO L82 PathProgramCache]: Analyzing trace with hash 770921802, now seen corresponding path program 666 times [2020-02-10 20:49:47,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:47,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165529044] [2020-02-10 20:49:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:47,802 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:49:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:47,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165529044] [2020-02-10 20:49:47,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:47,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:47,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263252688] [2020-02-10 20:49:47,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:47,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:47,810 INFO L87 Difference]: Start difference. First operand 1576 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:49:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:47,995 INFO L93 Difference]: Finished difference Result 2961 states and 11732 transitions. [2020-02-10 20:49:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:47,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:48,003 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:49:48,003 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:49:48,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:49:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1568. [2020-02-10 20:49:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:49:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7013 transitions. [2020-02-10 20:49:48,068 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7013 transitions. Word has length 28 [2020-02-10 20:49:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:48,068 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7013 transitions. [2020-02-10 20:49:48,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7013 transitions. [2020-02-10 20:49:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:48,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:48,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] [2020-02-10 20:49:48,071 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:48,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2078474900, now seen corresponding path program 667 times [2020-02-10 20:49:48,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:48,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172902684] [2020-02-10 20:49:48,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:48,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172902684] [2020-02-10 20:49:48,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:48,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:48,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349787090] [2020-02-10 20:49:48,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:48,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:48,602 INFO L87 Difference]: Start difference. First operand 1568 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:49:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:48,741 INFO L93 Difference]: Finished difference Result 2976 states and 11769 transitions. [2020-02-10 20:49:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:48,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:48,748 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:49:48,748 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:49:48,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:49:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1578. [2020-02-10 20:49:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:49:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7039 transitions. [2020-02-10 20:49:48,815 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7039 transitions. Word has length 28 [2020-02-10 20:49:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:48,815 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7039 transitions. [2020-02-10 20:49:48,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7039 transitions. [2020-02-10 20:49:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:48,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:48,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:48,817 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 900335092, now seen corresponding path program 668 times [2020-02-10 20:49:48,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:48,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548948808] [2020-02-10 20:49:48,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49: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 20:49:49,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548948808] [2020-02-10 20:49:49,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:49,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:49,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746692746] [2020-02-10 20:49:49,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:49,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:49,346 INFO L87 Difference]: Start difference. First operand 1578 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:49:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:49,518 INFO L93 Difference]: Finished difference Result 2970 states and 11753 transitions. [2020-02-10 20:49:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:49,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:49,526 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:49:49,526 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:49:49,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:49:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1573. [2020-02-10 20:49:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7026 transitions. [2020-02-10 20:49:49,592 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7026 transitions. Word has length 28 [2020-02-10 20:49:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:49,592 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7026 transitions. [2020-02-10 20:49:49,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7026 transitions. [2020-02-10 20:49:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:49,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:49,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] [2020-02-10 20:49:49,595 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:49,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:49,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1143407016, now seen corresponding path program 669 times [2020-02-10 20:49:49,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:49,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016195372] [2020-02-10 20:49:49,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:50,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016195372] [2020-02-10 20:49:50,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:50,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:50,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931464399] [2020-02-10 20:49:50,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:50,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:50,144 INFO L87 Difference]: Start difference. First operand 1573 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:49:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:50,283 INFO L93 Difference]: Finished difference Result 2982 states and 11779 transitions. [2020-02-10 20:49:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:50,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:50,291 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:49:50,291 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:49:50,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:49:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1581. [2020-02-10 20:49:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:49:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7040 transitions. [2020-02-10 20:49:50,375 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7040 transitions. Word has length 28 [2020-02-10 20:49:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:50,375 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7040 transitions. [2020-02-10 20:49:50,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7040 transitions. [2020-02-10 20:49:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:50,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:50,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] [2020-02-10 20:49:50,378 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1316654708, now seen corresponding path program 670 times [2020-02-10 20:49:50,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:50,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666206857] [2020-02-10 20:49:50,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:50,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666206857] [2020-02-10 20:49:50,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:50,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665067111] [2020-02-10 20:49:50,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:50,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:50,897 INFO L87 Difference]: Start difference. First operand 1581 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:49:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:51,072 INFO L93 Difference]: Finished difference Result 2979 states and 11766 transitions. [2020-02-10 20:49:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:51,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:51,080 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:49:51,080 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:49:51,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:49:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1573. [2020-02-10 20:49:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7021 transitions. [2020-02-10 20:49:51,147 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7021 transitions. Word has length 28 [2020-02-10 20:49:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:51,147 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7021 transitions. [2020-02-10 20:49:51,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7021 transitions. [2020-02-10 20:49:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:51,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:51,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:51,150 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1976046248, now seen corresponding path program 671 times [2020-02-10 20:49:51,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:51,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669219526] [2020-02-10 20:49:51,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:51,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669219526] [2020-02-10 20:49:51,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:51,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:51,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845739402] [2020-02-10 20:49:51,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:51,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:51,691 INFO L87 Difference]: Start difference. First operand 1573 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:49:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:51,874 INFO L93 Difference]: Finished difference Result 2966 states and 11741 transitions. [2020-02-10 20:49:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:51,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:51,882 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:49:51,882 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:49:51,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:49:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1577. [2020-02-10 20:49:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:49:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7028 transitions. [2020-02-10 20:49:51,949 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7028 transitions. Word has length 28 [2020-02-10 20:49:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:51,949 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7028 transitions. [2020-02-10 20:49:51,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7028 transitions. [2020-02-10 20:49:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:51,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:51,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] [2020-02-10 20:49:51,951 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash -829516052, now seen corresponding path program 672 times [2020-02-10 20:49:51,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:51,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603209485] [2020-02-10 20:49:51,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:52,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603209485] [2020-02-10 20:49:52,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:52,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:52,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075138188] [2020-02-10 20:49:52,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:52,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:52,487 INFO L87 Difference]: Start difference. First operand 1577 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:49:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:52,667 INFO L93 Difference]: Finished difference Result 2969 states and 11743 transitions. [2020-02-10 20:49:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:52,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:52,674 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:49:52,675 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:49:52,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:49:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1563. [2020-02-10 20:49:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:49:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 6999 transitions. [2020-02-10 20:49:52,741 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 6999 transitions. Word has length 28 [2020-02-10 20:49:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:52,741 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 6999 transitions. [2020-02-10 20:49:52,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 6999 transitions. [2020-02-10 20:49:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:52,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:52,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] [2020-02-10 20:49:52,744 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:52,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2033247324, now seen corresponding path program 673 times [2020-02-10 20:49:52,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:52,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205975545] [2020-02-10 20:49:52,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:53,268 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:53,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205975545] [2020-02-10 20:49:53,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:53,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:53,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9262357] [2020-02-10 20:49:53,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:53,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:53,275 INFO L87 Difference]: Start difference. First operand 1563 states and 6999 transitions. Second operand 11 states. [2020-02-10 20:49:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:53,461 INFO L93 Difference]: Finished difference Result 2957 states and 11739 transitions. [2020-02-10 20:49:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:53,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:53,469 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:49:53,469 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:49:53,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:49:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1577. [2020-02-10 20:49:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:49:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7044 transitions. [2020-02-10 20:49:53,536 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7044 transitions. Word has length 28 [2020-02-10 20:49:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:53,536 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7044 transitions. [2020-02-10 20:49:53,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7044 transitions. [2020-02-10 20:49:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:53,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:53,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:53,539 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:53,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:53,539 INFO L82 PathProgramCache]: Analyzing trace with hash -543842328, now seen corresponding path program 674 times [2020-02-10 20:49:53,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:53,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142141409] [2020-02-10 20:49:53,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:54,057 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:54,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142141409] [2020-02-10 20:49:54,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:54,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:54,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843627615] [2020-02-10 20:49:54,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:54,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:54,065 INFO L87 Difference]: Start difference. First operand 1577 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:49:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:54,275 INFO L93 Difference]: Finished difference Result 2959 states and 11737 transitions. [2020-02-10 20:49:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:54,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:54,282 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:49:54,282 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:49:54,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:49:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1571. [2020-02-10 20:49:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:49:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7029 transitions. [2020-02-10 20:49:54,348 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7029 transitions. Word has length 28 [2020-02-10 20:49:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:54,348 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7029 transitions. [2020-02-10 20:49:54,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7029 transitions. [2020-02-10 20:49:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:54,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:54,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] [2020-02-10 20:49:54,351 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1495391746, now seen corresponding path program 675 times [2020-02-10 20:49:54,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:54,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044134916] [2020-02-10 20:49:54,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:54,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044134916] [2020-02-10 20:49:54,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:54,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:54,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806363311] [2020-02-10 20:49:54,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:54,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:54,866 INFO L87 Difference]: Start difference. First operand 1571 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:49:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:55,057 INFO L93 Difference]: Finished difference Result 2951 states and 11721 transitions. [2020-02-10 20:49:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:55,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:55,065 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:49:55,065 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:49:55,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:49:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1575. [2020-02-10 20:49:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:49:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7036 transitions. [2020-02-10 20:49:55,131 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7036 transitions. Word has length 28 [2020-02-10 20:49:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:55,132 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7036 transitions. [2020-02-10 20:49:55,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7036 transitions. [2020-02-10 20:49:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:55,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:55,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] [2020-02-10 20:49:55,134 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2066846552, now seen corresponding path program 676 times [2020-02-10 20:49:55,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:55,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039751088] [2020-02-10 20:49:55,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:55,642 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039751088] [2020-02-10 20:49:55,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:55,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:55,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530121676] [2020-02-10 20:49:55,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:55,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:55,652 INFO L87 Difference]: Start difference. First operand 1575 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:49:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:55,836 INFO L93 Difference]: Finished difference Result 2949 states and 11713 transitions. [2020-02-10 20:49:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:55,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:55,843 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:49:55,843 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:49:55,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:49:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1571. [2020-02-10 20:49:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:49:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7025 transitions. [2020-02-10 20:49:55,909 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7025 transitions. Word has length 28 [2020-02-10 20:49:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:55,909 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7025 transitions. [2020-02-10 20:49:55,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7025 transitions. [2020-02-10 20:49:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:55,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:55,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] [2020-02-10 20:49:55,912 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1079072130, now seen corresponding path program 677 times [2020-02-10 20:49:55,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:55,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203320024] [2020-02-10 20:49:55,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:56,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203320024] [2020-02-10 20:49:56,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:56,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080270382] [2020-02-10 20:49:56,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:56,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:56,428 INFO L87 Difference]: Start difference. First operand 1571 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:49:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:56,606 INFO L93 Difference]: Finished difference Result 2955 states and 11725 transitions. [2020-02-10 20:49:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:56,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:56,614 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:49:56,614 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:49:56,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:49:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1575. [2020-02-10 20:49:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:49:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7032 transitions. [2020-02-10 20:49:56,703 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7032 transitions. Word has length 28 [2020-02-10 20:49:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:56,703 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7032 transitions. [2020-02-10 20:49:56,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7032 transitions. [2020-02-10 20:49:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:56,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:56,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] [2020-02-10 20:49:56,705 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1155035364, now seen corresponding path program 678 times [2020-02-10 20:49:56,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:56,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844547483] [2020-02-10 20:49:56,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:57,214 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:57,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844547483] [2020-02-10 20:49:57,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:57,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:57,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310699314] [2020-02-10 20:49:57,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:57,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:57,222 INFO L87 Difference]: Start difference. First operand 1575 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:49:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:57,432 INFO L93 Difference]: Finished difference Result 2951 states and 11713 transitions. [2020-02-10 20:49:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:57,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:57,439 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:49:57,439 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:49:57,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:49:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1567. [2020-02-10 20:49:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:49:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7014 transitions. [2020-02-10 20:49:57,506 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7014 transitions. Word has length 28 [2020-02-10 20:49:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:57,506 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7014 transitions. [2020-02-10 20:49:57,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7014 transitions. [2020-02-10 20:49:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:57,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:57,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:57,508 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash -939155736, now seen corresponding path program 679 times [2020-02-10 20:49:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018071827] [2020-02-10 20:49:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:58,040 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:58,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018071827] [2020-02-10 20:49:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:58,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763919028] [2020-02-10 20:49:58,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:58,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:58,047 INFO L87 Difference]: Start difference. First operand 1567 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:49:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:58,244 INFO L93 Difference]: Finished difference Result 2967 states and 11764 transitions. [2020-02-10 20:49:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:58,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:58,252 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:49:58,253 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 20:49:58,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 20:49:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1579. [2020-02-10 20:49:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:49:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7048 transitions. [2020-02-10 20:49:58,319 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7048 transitions. Word has length 28 [2020-02-10 20:49:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:58,319 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7048 transitions. [2020-02-10 20:49:58,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7048 transitions. [2020-02-10 20:49:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:58,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:58,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] [2020-02-10 20:49:58,321 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:58,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash 550249260, now seen corresponding path program 680 times [2020-02-10 20:49:58,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:58,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446548781] [2020-02-10 20:49:58,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:58,855 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:49:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:58,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446548781] [2020-02-10 20:49:58,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:58,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:58,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750105633] [2020-02-10 20:49:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:58,863 INFO L87 Difference]: Start difference. First operand 1579 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:49:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:59,108 INFO L93 Difference]: Finished difference Result 2969 states and 11762 transitions. [2020-02-10 20:49:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:59,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:59,115 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:49:59,116 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:49:59,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:49:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:49:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1573. [2020-02-10 20:49:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:49:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7031 transitions. [2020-02-10 20:49:59,182 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7031 transitions. Word has length 28 [2020-02-10 20:49:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:59,182 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7031 transitions. [2020-02-10 20:49:59,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:49:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7031 transitions. [2020-02-10 20:49:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:49:59,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:59,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:59,185 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:49:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1474385538, now seen corresponding path program 681 times [2020-02-10 20:49:59,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:59,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248607675] [2020-02-10 20:49:59,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:59,721 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:49:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:59,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248607675] [2020-02-10 20:49:59,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:59,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:49:59,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513165298] [2020-02-10 20:49:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:49:59,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:49:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:59,729 INFO L87 Difference]: Start difference. First operand 1573 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:49:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:59,976 INFO L93 Difference]: Finished difference Result 2966 states and 11756 transitions. [2020-02-10 20:49:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:49:59,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:49:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:59,984 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 20:49:59,984 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:49:59,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:50:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1579. [2020-02-10 20:50:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:50:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7042 transitions. [2020-02-10 20:50:00,051 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7042 transitions. Word has length 28 [2020-02-10 20:50:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:00,051 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7042 transitions. [2020-02-10 20:50:00,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7042 transitions. [2020-02-10 20:50:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:00,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:00,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:00,054 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash -556435348, now seen corresponding path program 682 times [2020-02-10 20:50:00,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:00,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244874451] [2020-02-10 20:50:00,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:00,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244874451] [2020-02-10 20:50:00,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:00,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:00,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764027456] [2020-02-10 20:50:00,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:00,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:00,590 INFO L87 Difference]: Start difference. First operand 1579 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:50:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:00,778 INFO L93 Difference]: Finished difference Result 2967 states and 11752 transitions. [2020-02-10 20:50:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:00,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:00,786 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:50:00,786 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:50:00,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:50:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1573. [2020-02-10 20:50:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:50:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7025 transitions. [2020-02-10 20:50:00,853 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7025 transitions. Word has length 28 [2020-02-10 20:50:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:00,853 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7025 transitions. [2020-02-10 20:50:00,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7025 transitions. [2020-02-10 20:50:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:00,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:00,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] [2020-02-10 20:50:00,856 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1058065922, now seen corresponding path program 683 times [2020-02-10 20:50:00,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:00,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973663355] [2020-02-10 20:50:00,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:01,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973663355] [2020-02-10 20:50:01,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:01,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:01,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805077885] [2020-02-10 20:50:01,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:01,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:01,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:01,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:01,388 INFO L87 Difference]: Start difference. First operand 1573 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:50:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:01,576 INFO L93 Difference]: Finished difference Result 2971 states and 11761 transitions. [2020-02-10 20:50:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:01,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:01,585 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 20:50:01,585 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:50:01,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:50:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1580. [2020-02-10 20:50:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7038 transitions. [2020-02-10 20:50:01,654 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7038 transitions. Word has length 28 [2020-02-10 20:50:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:01,654 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7038 transitions. [2020-02-10 20:50:01,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7038 transitions. [2020-02-10 20:50:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:01,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:01,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] [2020-02-10 20:50:01,656 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1629520728, now seen corresponding path program 684 times [2020-02-10 20:50:01,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:01,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101689532] [2020-02-10 20:50:01,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:02,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101689532] [2020-02-10 20:50:02,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:02,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:02,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150646446] [2020-02-10 20:50:02,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:02,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:02,187 INFO L87 Difference]: Start difference. First operand 1580 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:50:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:02,378 INFO L93 Difference]: Finished difference Result 2970 states and 11752 transitions. [2020-02-10 20:50:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:02,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:02,386 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:50:02,386 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 20:50:02,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 20:50:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1567. [2020-02-10 20:50:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:50:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7010 transitions. [2020-02-10 20:50:02,455 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7010 transitions. Word has length 28 [2020-02-10 20:50:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:02,455 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7010 transitions. [2020-02-10 20:50:02,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7010 transitions. [2020-02-10 20:50:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:02,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:02,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] [2020-02-10 20:50:02,458 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash -907646424, now seen corresponding path program 685 times [2020-02-10 20:50:02,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:02,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513314697] [2020-02-10 20:50:02,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:02,979 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:50:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:02,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513314697] [2020-02-10 20:50:02,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:02,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:02,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056972522] [2020-02-10 20:50:02,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:02,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:02,987 INFO L87 Difference]: Start difference. First operand 1567 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:50:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:03,180 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 20:50:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:03,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:03,189 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:50:03,189 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 20:50:03,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 20:50:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1575. [2020-02-10 20:50:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7032 transitions. [2020-02-10 20:50:03,275 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7032 transitions. Word has length 28 [2020-02-10 20:50:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:03,275 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7032 transitions. [2020-02-10 20:50:03,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7032 transitions. [2020-02-10 20:50:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:03,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:03,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:03,278 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1479101230, now seen corresponding path program 686 times [2020-02-10 20:50:03,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:03,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146763234] [2020-02-10 20:50:03,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:03,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146763234] [2020-02-10 20:50:03,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:03,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792783188] [2020-02-10 20:50:03,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:03,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:03,790 INFO L87 Difference]: Start difference. First operand 1575 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:50:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:03,978 INFO L93 Difference]: Finished difference Result 2948 states and 11707 transitions. [2020-02-10 20:50:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:03,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:03,985 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:50:03,985 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:50:03,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:50:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1571. [2020-02-10 20:50:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:50:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7021 transitions. [2020-02-10 20:50:04,052 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7021 transitions. Word has length 28 [2020-02-10 20:50:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:04,052 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7021 transitions. [2020-02-10 20:50:04,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7021 transitions. [2020-02-10 20:50:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:04,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:04,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:04,054 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1980731804, now seen corresponding path program 687 times [2020-02-10 20:50:04,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:04,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770967305] [2020-02-10 20:50:04,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:04,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770967305] [2020-02-10 20:50:04,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:04,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:04,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728656978] [2020-02-10 20:50:04,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:04,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:04,602 INFO L87 Difference]: Start difference. First operand 1571 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:50:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:04,810 INFO L93 Difference]: Finished difference Result 2955 states and 11723 transitions. [2020-02-10 20:50:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:04,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:04,818 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:50:04,818 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:50:04,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:50:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1577. [2020-02-10 20:50:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:50:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7032 transitions. [2020-02-10 20:50:04,885 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7032 transitions. Word has length 28 [2020-02-10 20:50:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:04,885 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7032 transitions. [2020-02-10 20:50:04,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7032 transitions. [2020-02-10 20:50:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:04,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:04,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:04,888 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1062781614, now seen corresponding path program 688 times [2020-02-10 20:50:04,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:04,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698519438] [2020-02-10 20:50:04,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:05,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698519438] [2020-02-10 20:50:05,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:05,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:05,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968259776] [2020-02-10 20:50:05,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:05,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:05,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:05,416 INFO L87 Difference]: Start difference. First operand 1577 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:50:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:05,614 INFO L93 Difference]: Finished difference Result 2956 states and 11719 transitions. [2020-02-10 20:50:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:05,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:05,622 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:50:05,622 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:50:05,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:50:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1571. [2020-02-10 20:50:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:50:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7017 transitions. [2020-02-10 20:50:05,690 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7017 transitions. Word has length 28 [2020-02-10 20:50:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:05,690 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7017 transitions. [2020-02-10 20:50:05,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7017 transitions. [2020-02-10 20:50:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:05,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:05,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:05,692 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1207550884, now seen corresponding path program 689 times [2020-02-10 20:50:05,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:05,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204918665] [2020-02-10 20:50:05,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:06,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204918665] [2020-02-10 20:50:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:06,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541653678] [2020-02-10 20:50:06,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:06,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:06,223 INFO L87 Difference]: Start difference. First operand 1571 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:50:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:06,403 INFO L93 Difference]: Finished difference Result 2949 states and 11705 transitions. [2020-02-10 20:50:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:06,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:06,411 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:50:06,411 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:50:06,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:50:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1575. [2020-02-10 20:50:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7024 transitions. [2020-02-10 20:50:06,478 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7024 transitions. Word has length 28 [2020-02-10 20:50:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:06,478 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7024 transitions. [2020-02-10 20:50:06,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7024 transitions. [2020-02-10 20:50:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:06,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:06,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:06,480 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:06,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1598011416, now seen corresponding path program 690 times [2020-02-10 20:50:06,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:06,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604725380] [2020-02-10 20:50:06,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:07,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604725380] [2020-02-10 20:50:07,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:07,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:07,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737668405] [2020-02-10 20:50:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:07,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:07,003 INFO L87 Difference]: Start difference. First operand 1575 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:50:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:07,191 INFO L93 Difference]: Finished difference Result 2952 states and 11707 transitions. [2020-02-10 20:50:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:07,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:07,199 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:50:07,199 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:50:07,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:50:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1567. [2020-02-10 20:50:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:50:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7006 transitions. [2020-02-10 20:50:07,265 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7006 transitions. Word has length 28 [2020-02-10 20:50:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:07,265 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7006 transitions. [2020-02-10 20:50:07,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7006 transitions. [2020-02-10 20:50:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:07,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:07,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] [2020-02-10 20:50:07,267 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash 602764780, now seen corresponding path program 691 times [2020-02-10 20:50:07,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:07,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195736710] [2020-02-10 20:50:07,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:07,785 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:50:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:07,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195736710] [2020-02-10 20:50:07,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:07,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:07,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451718581] [2020-02-10 20:50:07,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:07,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:07,793 INFO L87 Difference]: Start difference. First operand 1567 states and 7006 transitions. Second operand 11 states. [2020-02-10 20:50:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:07,987 INFO L93 Difference]: Finished difference Result 2957 states and 11726 transitions. [2020-02-10 20:50:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:07,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:07,994 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:50:07,995 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 20:50:07,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 20:50:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1575. [2020-02-10 20:50:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7028 transitions. [2020-02-10 20:50:08,061 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7028 transitions. Word has length 28 [2020-02-10 20:50:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:08,061 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7028 transitions. [2020-02-10 20:50:08,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7028 transitions. [2020-02-10 20:50:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:08,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:08,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:08,064 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1458095022, now seen corresponding path program 692 times [2020-02-10 20:50:08,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:08,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698615070] [2020-02-10 20:50:08,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:08,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698615070] [2020-02-10 20:50:08,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:08,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:08,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289487957] [2020-02-10 20:50:08,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:08,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:08,588 INFO L87 Difference]: Start difference. First operand 1575 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:50:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:08,763 INFO L93 Difference]: Finished difference Result 2953 states and 11714 transitions. [2020-02-10 20:50:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:08,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:08,771 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:50:08,771 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:50:08,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:50:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1571. [2020-02-10 20:50:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:50:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7017 transitions. [2020-02-10 20:50:08,838 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7017 transitions. Word has length 28 [2020-02-10 20:50:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:08,838 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7017 transitions. [2020-02-10 20:50:08,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7017 transitions. [2020-02-10 20:50:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:08,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:08,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:08,840 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash -470320600, now seen corresponding path program 693 times [2020-02-10 20:50:08,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:08,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826753494] [2020-02-10 20:50:08,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:09,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826753494] [2020-02-10 20:50:09,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:09,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:09,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799531010] [2020-02-10 20:50:09,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:09,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:09,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:09,379 INFO L87 Difference]: Start difference. First operand 1571 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:50:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:09,578 INFO L93 Difference]: Finished difference Result 2963 states and 11737 transitions. [2020-02-10 20:50:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:09,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:09,585 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:50:09,586 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:50:09,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:50:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1578. [2020-02-10 20:50:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:50:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7030 transitions. [2020-02-10 20:50:09,673 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7030 transitions. Word has length 28 [2020-02-10 20:50:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:09,673 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7030 transitions. [2020-02-10 20:50:09,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7030 transitions. [2020-02-10 20:50:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:09,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:09,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:09,675 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1041775406, now seen corresponding path program 694 times [2020-02-10 20:50:09,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:09,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648183432] [2020-02-10 20:50:09,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:10,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648183432] [2020-02-10 20:50:10,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:10,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:10,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866488373] [2020-02-10 20:50:10,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:10,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:10,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:10,206 INFO L87 Difference]: Start difference. First operand 1578 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:50:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:10,380 INFO L93 Difference]: Finished difference Result 2962 states and 11728 transitions. [2020-02-10 20:50:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:10,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:10,388 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:50:10,389 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:50:10,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:50:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1571. [2020-02-10 20:50:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:50:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7013 transitions. [2020-02-10 20:50:10,454 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7013 transitions. Word has length 28 [2020-02-10 20:50:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:10,455 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7013 transitions. [2020-02-10 20:50:10,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7013 transitions. [2020-02-10 20:50:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:10,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:10,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] [2020-02-10 20:50:10,458 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1993324824, now seen corresponding path program 695 times [2020-02-10 20:50:10,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:10,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065664193] [2020-02-10 20:50:10,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:10,975 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:50:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:10,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065664193] [2020-02-10 20:50:10,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:10,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:10,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772332734] [2020-02-10 20:50:10,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:10,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:10,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:10,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:10,983 INFO L87 Difference]: Start difference. First operand 1571 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:50:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:11,162 INFO L93 Difference]: Finished difference Result 2952 states and 11708 transitions. [2020-02-10 20:50:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:11,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:11,169 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:50:11,170 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 20:50:11,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 20:50:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1575. [2020-02-10 20:50:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7020 transitions. [2020-02-10 20:50:11,236 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7020 transitions. Word has length 28 [2020-02-10 20:50:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:11,236 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7020 transitions. [2020-02-10 20:50:11,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7020 transitions. [2020-02-10 20:50:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:11,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:11,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:11,238 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash -503919828, now seen corresponding path program 696 times [2020-02-10 20:50:11,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:11,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370134476] [2020-02-10 20:50:11,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:11,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370134476] [2020-02-10 20:50:11,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:11,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:11,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470724875] [2020-02-10 20:50:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:11,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:11,762 INFO L87 Difference]: Start difference. First operand 1575 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:50:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:11,976 INFO L93 Difference]: Finished difference Result 2955 states and 11710 transitions. [2020-02-10 20:50:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:11,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:11,984 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:50:11,984 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:50:11,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:50:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1563. [2020-02-10 20:50:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:50:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 6995 transitions. [2020-02-10 20:50:12,052 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 6995 transitions. Word has length 28 [2020-02-10 20:50:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:12,052 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 6995 transitions. [2020-02-10 20:50:12,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 6995 transitions. [2020-02-10 20:50:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:12,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:12,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:12,054 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 647992356, now seen corresponding path program 697 times [2020-02-10 20:50:12,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:12,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660376002] [2020-02-10 20:50:12,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:12,604 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:50:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:12,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660376002] [2020-02-10 20:50:12,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:12,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:12,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063643850] [2020-02-10 20:50:12,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:12,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:12,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:12,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:12,612 INFO L87 Difference]: Start difference. First operand 1563 states and 6995 transitions. Second operand 11 states. [2020-02-10 20:50:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:12,757 INFO L93 Difference]: Finished difference Result 3001 states and 11831 transitions. [2020-02-10 20:50:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:12,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:12,765 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:50:12,765 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:50:12,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:50:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1586. [2020-02-10 20:50:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:50:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7060 transitions. [2020-02-10 20:50:12,834 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7060 transitions. Word has length 28 [2020-02-10 20:50:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:12,834 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7060 transitions. [2020-02-10 20:50:12,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7060 transitions. [2020-02-10 20:50:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:12,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:12,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:12,837 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:12,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1392694854, now seen corresponding path program 698 times [2020-02-10 20:50:12,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:12,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121209672] [2020-02-10 20:50:12,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:13,382 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:50:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:13,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121209672] [2020-02-10 20:50:13,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:13,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:13,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986077895] [2020-02-10 20:50:13,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:13,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:13,390 INFO L87 Difference]: Start difference. First operand 1586 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:50:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:13,565 INFO L93 Difference]: Finished difference Result 2999 states and 11819 transitions. [2020-02-10 20:50:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:13,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:13,572 INFO L225 Difference]: With dead ends: 2999 [2020-02-10 20:50:13,572 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:50:13,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:50:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1576. [2020-02-10 20:50:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:50:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7037 transitions. [2020-02-10 20:50:13,640 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7037 transitions. Word has length 28 [2020-02-10 20:50:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:13,641 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7037 transitions. [2020-02-10 20:50:13,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7037 transitions. [2020-02-10 20:50:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:13,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:13,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:13,643 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1185847934, now seen corresponding path program 699 times [2020-02-10 20:50:13,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:13,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760903186] [2020-02-10 20:50:13,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:14,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760903186] [2020-02-10 20:50:14,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:14,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:14,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145003496] [2020-02-10 20:50:14,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:14,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:14,195 INFO L87 Difference]: Start difference. First operand 1576 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:50:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:14,335 INFO L93 Difference]: Finished difference Result 2992 states and 11804 transitions. [2020-02-10 20:50:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:14,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:14,342 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:50:14,342 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:50:14,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:50:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1581. [2020-02-10 20:50:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:50:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7045 transitions. [2020-02-10 20:50:14,410 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7045 transitions. Word has length 28 [2020-02-10 20:50:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:14,410 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7045 transitions. [2020-02-10 20:50:14,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7045 transitions. [2020-02-10 20:50:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:14,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:14,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:14,413 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash -130309370, now seen corresponding path program 700 times [2020-02-10 20:50:14,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:14,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239112368] [2020-02-10 20:50:14,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:14,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239112368] [2020-02-10 20:50:14,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:14,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:14,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971018600] [2020-02-10 20:50:14,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:14,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:14,952 INFO L87 Difference]: Start difference. First operand 1581 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:50:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:15,176 INFO L93 Difference]: Finished difference Result 2986 states and 11788 transitions. [2020-02-10 20:50:15,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:15,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:15,184 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:50:15,184 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:50:15,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:50:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1576. [2020-02-10 20:50:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:50:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7032 transitions. [2020-02-10 20:50:15,252 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7032 transitions. Word has length 28 [2020-02-10 20:50:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:15,252 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7032 transitions. [2020-02-10 20:50:15,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7032 transitions. [2020-02-10 20:50:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:15,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:15,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:15,254 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash -753475906, now seen corresponding path program 701 times [2020-02-10 20:50:15,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:15,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093803479] [2020-02-10 20:50:15,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:15,790 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:50:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:15,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093803479] [2020-02-10 20:50:15,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:15,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:15,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524499566] [2020-02-10 20:50:15,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:15,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:15,798 INFO L87 Difference]: Start difference. First operand 1576 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:50:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:15,981 INFO L93 Difference]: Finished difference Result 2987 states and 11791 transitions. [2020-02-10 20:50:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:15,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:15,988 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:50:15,988 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 20:50:15,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 20:50:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1580. [2020-02-10 20:50:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7039 transitions. [2020-02-10 20:50:16,058 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7039 transitions. Word has length 28 [2020-02-10 20:50:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:16,058 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7039 transitions. [2020-02-10 20:50:16,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7039 transitions. [2020-02-10 20:50:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:16,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:16,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:16,060 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1480631588, now seen corresponding path program 702 times [2020-02-10 20:50:16,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:16,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987843829] [2020-02-10 20:50:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:16,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987843829] [2020-02-10 20:50:16,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:16,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:16,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406296407] [2020-02-10 20:50:16,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:16,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:16,610 INFO L87 Difference]: Start difference. First operand 1580 states and 7039 transitions. Second operand 11 states. [2020-02-10 20:50:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:16,788 INFO L93 Difference]: Finished difference Result 2983 states and 11779 transitions. [2020-02-10 20:50:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:16,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:16,796 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:50:16,797 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:50:16,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:50:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1570. [2020-02-10 20:50:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:50:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7017 transitions. [2020-02-10 20:50:16,863 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7017 transitions. Word has length 28 [2020-02-10 20:50:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:16,863 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7017 transitions. [2020-02-10 20:50:16,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7017 transitions. [2020-02-10 20:50:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:16,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:16,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:16,866 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:16,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1742083944, now seen corresponding path program 703 times [2020-02-10 20:50:16,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:16,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544884746] [2020-02-10 20:50:16,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:17,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544884746] [2020-02-10 20:50:17,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:17,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:17,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120262828] [2020-02-10 20:50:17,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:17,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:17,425 INFO L87 Difference]: Start difference. First operand 1570 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:50:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:17,591 INFO L93 Difference]: Finished difference Result 3014 states and 11862 transitions. [2020-02-10 20:50:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:17,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:17,599 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 20:50:17,599 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 20:50:17,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 20:50:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1590. [2020-02-10 20:50:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:50:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7067 transitions. [2020-02-10 20:50:17,666 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7067 transitions. Word has length 28 [2020-02-10 20:50:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:17,666 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7067 transitions. [2020-02-10 20:50:17,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7067 transitions. [2020-02-10 20:50:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:17,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50: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] [2020-02-10 20:50:17,668 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1808180854, now seen corresponding path program 704 times [2020-02-10 20:50:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285342439] [2020-02-10 20:50:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:18,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285342439] [2020-02-10 20:50:18,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:18,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:18,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965326295] [2020-02-10 20:50:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:18,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:18,221 INFO L87 Difference]: Start difference. First operand 1590 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:50:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:18,436 INFO L93 Difference]: Finished difference Result 3012 states and 11850 transitions. [2020-02-10 20:50:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:18,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:18,444 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:50:18,444 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:50:18,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:50:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1580. [2020-02-10 20:50:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7041 transitions. [2020-02-10 20:50:18,511 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7041 transitions. Word has length 28 [2020-02-10 20:50:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:18,511 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7041 transitions. [2020-02-10 20:50:18,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7041 transitions. [2020-02-10 20:50:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:18,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:18,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] [2020-02-10 20:50:18,513 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1206854142, now seen corresponding path program 705 times [2020-02-10 20:50:18,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:18,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317352142] [2020-02-10 20:50:18,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:19,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317352142] [2020-02-10 20:50:19,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:19,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:19,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609959147] [2020-02-10 20:50:19,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:19,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:19,068 INFO L87 Difference]: Start difference. First operand 1580 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:50:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:19,201 INFO L93 Difference]: Finished difference Result 3011 states and 11847 transitions. [2020-02-10 20:50:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:19,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:19,208 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 20:50:19,208 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 20:50:19,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 20:50:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1588. [2020-02-10 20:50:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:50:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7055 transitions. [2020-02-10 20:50:19,276 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7055 transitions. Word has length 28 [2020-02-10 20:50:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:19,277 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7055 transitions. [2020-02-10 20:50:19,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7055 transitions. [2020-02-10 20:50:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:19,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:19,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:19,279 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1380101834, now seen corresponding path program 706 times [2020-02-10 20:50:19,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:19,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048649126] [2020-02-10 20:50:19,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:19,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048649126] [2020-02-10 20:50:19,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:19,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:19,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216663942] [2020-02-10 20:50:19,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:19,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:19,820 INFO L87 Difference]: Start difference. First operand 1588 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:50:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:20,027 INFO L93 Difference]: Finished difference Result 3008 states and 11834 transitions. [2020-02-10 20:50:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:20,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:20,035 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:50:20,035 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:50:20,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:50:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1580. [2020-02-10 20:50:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7033 transitions. [2020-02-10 20:50:20,103 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7033 transitions. Word has length 28 [2020-02-10 20:50:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:20,103 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7033 transitions. [2020-02-10 20:50:20,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7033 transitions. [2020-02-10 20:50:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:20,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:20,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] [2020-02-10 20:50:20,106 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash -732469698, now seen corresponding path program 707 times [2020-02-10 20:50:20,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:20,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096833374] [2020-02-10 20:50:20,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:20,649 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:50:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:20,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096833374] [2020-02-10 20:50:20,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:20,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:20,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130418837] [2020-02-10 20:50:20,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:20,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:20,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:20,658 INFO L87 Difference]: Start difference. First operand 1580 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:50:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:20,846 INFO L93 Difference]: Finished difference Result 3006 states and 11831 transitions. [2020-02-10 20:50:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:20,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:20,853 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:50:20,854 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 20:50:20,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 20:50:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1587. [2020-02-10 20:50:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:50:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7046 transitions. [2020-02-10 20:50:20,921 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7046 transitions. Word has length 28 [2020-02-10 20:50:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:20,922 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7046 transitions. [2020-02-10 20:50:20,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7046 transitions. [2020-02-10 20:50:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:20,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:20,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] [2020-02-10 20:50:20,924 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1303924504, now seen corresponding path program 708 times [2020-02-10 20:50:20,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:20,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35572414] [2020-02-10 20:50:20,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:21,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35572414] [2020-02-10 20:50:21,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:21,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:21,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671320043] [2020-02-10 20:50:21,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:21,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:21,480 INFO L87 Difference]: Start difference. First operand 1587 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:50:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:21,671 INFO L93 Difference]: Finished difference Result 3005 states and 11822 transitions. [2020-02-10 20:50:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:21,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:21,680 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:50:21,680 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:50:21,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:50:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1570. [2020-02-10 20:50:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:50:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7010 transitions. [2020-02-10 20:50:21,748 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7010 transitions. Word has length 28 [2020-02-10 20:50:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:21,748 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7010 transitions. [2020-02-10 20:50:21,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7010 transitions. [2020-02-10 20:50:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:21,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:21,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] [2020-02-10 20:50:21,751 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1773593256, now seen corresponding path program 709 times [2020-02-10 20:50:21,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:21,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425854417] [2020-02-10 20:50:21,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:22,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425854417] [2020-02-10 20:50:22,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:22,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:22,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757443822] [2020-02-10 20:50:22,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:22,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:22,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:22,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:22,295 INFO L87 Difference]: Start difference. First operand 1570 states and 7010 transitions. Second operand 11 states. [2020-02-10 20:50:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:22,474 INFO L93 Difference]: Finished difference Result 2988 states and 11789 transitions. [2020-02-10 20:50:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:22,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:22,481 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:50:22,481 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:50:22,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:50:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1580. [2020-02-10 20:50:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7036 transitions. [2020-02-10 20:50:22,548 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7036 transitions. Word has length 28 [2020-02-10 20:50:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:22,548 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7036 transitions. [2020-02-10 20:50:22,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7036 transitions. [2020-02-10 20:50:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:22,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:22,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:22,550 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash 457435952, now seen corresponding path program 710 times [2020-02-10 20:50:22,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:22,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967040025] [2020-02-10 20:50:22,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:23,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967040025] [2020-02-10 20:50:23,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:23,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:23,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460209383] [2020-02-10 20:50:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:23,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:23,074 INFO L87 Difference]: Start difference. First operand 1580 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:50:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:23,269 INFO L93 Difference]: Finished difference Result 2982 states and 11773 transitions. [2020-02-10 20:50:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:23,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:23,278 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:50:23,278 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:50:23,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:50:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1575. [2020-02-10 20:50:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7023 transitions. [2020-02-10 20:50:23,345 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7023 transitions. Word has length 28 [2020-02-10 20:50:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:23,345 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7023 transitions. [2020-02-10 20:50:23,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7023 transitions. [2020-02-10 20:50:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:23,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:23,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:23,347 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash 700507876, now seen corresponding path program 711 times [2020-02-10 20:50:23,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:23,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347354842] [2020-02-10 20:50:23,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:23,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347354842] [2020-02-10 20:50:23,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:23,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:23,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167520164] [2020-02-10 20:50:23,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:23,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:23,886 INFO L87 Difference]: Start difference. First operand 1575 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:50:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:24,035 INFO L93 Difference]: Finished difference Result 2994 states and 11799 transitions. [2020-02-10 20:50:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:24,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:24,043 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:50:24,043 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:50:24,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:50:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1583. [2020-02-10 20:50:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:50:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7037 transitions. [2020-02-10 20:50:24,111 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7037 transitions. Word has length 28 [2020-02-10 20:50:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:24,111 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7037 transitions. [2020-02-10 20:50:24,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7037 transitions. [2020-02-10 20:50:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:24,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:24,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] [2020-02-10 20:50:24,114 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash 873755568, now seen corresponding path program 712 times [2020-02-10 20:50:24,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:24,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089188227] [2020-02-10 20:50:24,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:24,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089188227] [2020-02-10 20:50:24,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:24,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:24,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50682376] [2020-02-10 20:50:24,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:24,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:24,654 INFO L87 Difference]: Start difference. First operand 1583 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:50:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:24,882 INFO L93 Difference]: Finished difference Result 2991 states and 11786 transitions. [2020-02-10 20:50:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:24,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:24,891 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:50:24,891 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:50:24,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:50:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1575. [2020-02-10 20:50:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7018 transitions. [2020-02-10 20:50:24,958 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7018 transitions. Word has length 28 [2020-02-10 20:50:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:24,958 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7018 transitions. [2020-02-10 20:50:24,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7018 transitions. [2020-02-10 20:50:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:24,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:24,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] [2020-02-10 20:50:24,960 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1533147108, now seen corresponding path program 713 times [2020-02-10 20:50:24,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:24,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654834655] [2020-02-10 20:50:24,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:25,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654834655] [2020-02-10 20:50:25,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:25,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:25,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560573783] [2020-02-10 20:50:25,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:25,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:25,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:25,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:25,499 INFO L87 Difference]: Start difference. First operand 1575 states and 7018 transitions. Second operand 11 states. [2020-02-10 20:50:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:25,726 INFO L93 Difference]: Finished difference Result 2978 states and 11761 transitions. [2020-02-10 20:50:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:25,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:25,734 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:50:25,734 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:50:25,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:50:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1579. [2020-02-10 20:50:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:50:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7025 transitions. [2020-02-10 20:50:25,801 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7025 transitions. Word has length 28 [2020-02-10 20:50:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:25,802 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7025 transitions. [2020-02-10 20:50:25,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7025 transitions. [2020-02-10 20:50:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:25,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:25,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:25,804 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:25,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1272415192, now seen corresponding path program 714 times [2020-02-10 20:50:25,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:25,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680235346] [2020-02-10 20:50:25,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:26,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680235346] [2020-02-10 20:50:26,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:26,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:26,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032614875] [2020-02-10 20:50:26,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:26,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:26,336 INFO L87 Difference]: Start difference. First operand 1579 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:50:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:26,546 INFO L93 Difference]: Finished difference Result 2981 states and 11763 transitions. [2020-02-10 20:50:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:26,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:26,554 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:50:26,554 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:50:26,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:50:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1570. [2020-02-10 20:50:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:50:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7005 transitions. [2020-02-10 20:50:26,621 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7005 transitions. Word has length 28 [2020-02-10 20:50:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:26,622 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7005 transitions. [2020-02-10 20:50:26,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7005 transitions. [2020-02-10 20:50:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:26,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:26,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:26,624 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1766168438, now seen corresponding path program 715 times [2020-02-10 20:50:26,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:26,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658526348] [2020-02-10 20:50:26,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:27,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658526348] [2020-02-10 20:50:27,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:27,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88225686] [2020-02-10 20:50:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:27,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:27,148 INFO L87 Difference]: Start difference. First operand 1570 states and 7005 transitions. Second operand 11 states. [2020-02-10 20:50:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:27,332 INFO L93 Difference]: Finished difference Result 2978 states and 11766 transitions. [2020-02-10 20:50:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:27,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:27,340 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:50:27,340 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:50:27,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:50:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1578. [2020-02-10 20:50:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:50:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7027 transitions. [2020-02-10 20:50:27,407 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7027 transitions. Word has length 28 [2020-02-10 20:50:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:27,407 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7027 transitions. [2020-02-10 20:50:27,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7027 transitions. [2020-02-10 20:50:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:27,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:27,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] [2020-02-10 20:50:27,410 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash 467939056, now seen corresponding path program 716 times [2020-02-10 20:50:27,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:27,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489973314] [2020-02-10 20:50:27,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:27,932 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:50:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:27,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489973314] [2020-02-10 20:50:27,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:27,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:27,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20869246] [2020-02-10 20:50:27,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:27,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:27,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:27,940 INFO L87 Difference]: Start difference. First operand 1578 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:50:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:28,160 INFO L93 Difference]: Finished difference Result 2974 states and 11754 transitions. [2020-02-10 20:50:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:28,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:28,167 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:50:28,168 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:50:28,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:50:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1574. [2020-02-10 20:50:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:50:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7016 transitions. [2020-02-10 20:50:28,257 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7016 transitions. Word has length 28 [2020-02-10 20:50:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:28,257 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7016 transitions. [2020-02-10 20:50:28,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7016 transitions. [2020-02-10 20:50:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:28,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:28,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] [2020-02-10 20:50:28,259 INFO L427 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1455713478, now seen corresponding path program 717 times [2020-02-10 20:50:28,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:28,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861113521] [2020-02-10 20:50:28,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:28,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861113521] [2020-02-10 20:50:28,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:28,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:28,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629243596] [2020-02-10 20:50:28,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:28,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:28,798 INFO L87 Difference]: Start difference. First operand 1574 states and 7016 transitions. Second operand 11 states. [2020-02-10 20:50:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:29,011 INFO L93 Difference]: Finished difference Result 2984 states and 11777 transitions. [2020-02-10 20:50:29,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:29,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:29,019 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:50:29,019 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:50:29,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:50:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1581. [2020-02-10 20:50:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:50:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7029 transitions. [2020-02-10 20:50:29,087 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7029 transitions. Word has length 28 [2020-02-10 20:50:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:29,087 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7029 transitions. [2020-02-10 20:50:29,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7029 transitions. [2020-02-10 20:50:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:29,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:29,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:29,089 INFO L427 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 884258672, now seen corresponding path program 718 times [2020-02-10 20:50:29,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:29,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485609089] [2020-02-10 20:50:29,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:29,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485609089] [2020-02-10 20:50:29,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:29,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75563200] [2020-02-10 20:50:29,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:29,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:29,628 INFO L87 Difference]: Start difference. First operand 1581 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:50:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:29,862 INFO L93 Difference]: Finished difference Result 2983 states and 11768 transitions. [2020-02-10 20:50:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:29,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:29,869 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:50:29,869 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:50:29,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:50:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1574. [2020-02-10 20:50:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:50:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7012 transitions. [2020-02-10 20:50:29,937 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7012 transitions. Word has length 28 [2020-02-10 20:50:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:29,937 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7012 transitions. [2020-02-10 20:50:29,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7012 transitions. [2020-02-10 20:50:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:29,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:29,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:29,939 INFO L427 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -67290746, now seen corresponding path program 719 times [2020-02-10 20:50:29,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:29,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410155814] [2020-02-10 20:50:29,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410155814] [2020-02-10 20:50:30,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:30,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:30,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051780485] [2020-02-10 20:50:30,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:30,463 INFO L87 Difference]: Start difference. First operand 1574 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:50:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:30,693 INFO L93 Difference]: Finished difference Result 2973 states and 11748 transitions. [2020-02-10 20:50:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:30,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:30,701 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:50:30,701 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 20:50:30,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 20:50:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1578. [2020-02-10 20:50:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:50:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7019 transitions. [2020-02-10 20:50:30,768 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7019 transitions. Word has length 28 [2020-02-10 20:50:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:30,768 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7019 transitions. [2020-02-10 20:50:30,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7019 transitions. [2020-02-10 20:50:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:30,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:30,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:30,771 INFO L427 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1422114250, now seen corresponding path program 720 times [2020-02-10 20:50:30,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:30,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415327283] [2020-02-10 20:50:30,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:31,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415327283] [2020-02-10 20:50:31,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:31,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:31,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895729099] [2020-02-10 20:50:31,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:31,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:31,305 INFO L87 Difference]: Start difference. First operand 1578 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:50:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:31,542 INFO L93 Difference]: Finished difference Result 2976 states and 11750 transitions. [2020-02-10 20:50:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:31,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:31,549 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:50:31,550 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:50:31,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:50:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1545. [2020-02-10 20:50:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2020-02-10 20:50:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 6955 transitions. [2020-02-10 20:50:31,616 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 6955 transitions. Word has length 28 [2020-02-10 20:50:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:31,616 INFO L479 AbstractCegarLoop]: Abstraction has 1545 states and 6955 transitions. [2020-02-10 20:50:31,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 6955 transitions. [2020-02-10 20:50:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:31,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:31,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:31,618 INFO L427 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash -645301276, now seen corresponding path program 721 times [2020-02-10 20:50:31,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:31,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983043564] [2020-02-10 20:50:31,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:32,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983043564] [2020-02-10 20:50:32,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:32,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:32,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091153138] [2020-02-10 20:50:32,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:32,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:32,161 INFO L87 Difference]: Start difference. First operand 1545 states and 6955 transitions. Second operand 11 states. [2020-02-10 20:50:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:32,428 INFO L93 Difference]: Finished difference Result 2968 states and 11774 transitions. [2020-02-10 20:50:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:32,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:32,436 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:50:32,436 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:50:32,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:50:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1581. [2020-02-10 20:50:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:50:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7101 transitions. [2020-02-10 20:50:32,504 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7101 transitions. Word has length 28 [2020-02-10 20:50:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:32,505 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7101 transitions. [2020-02-10 20:50:32,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7101 transitions. [2020-02-10 20:50:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:32,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:32,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:32,507 INFO L427 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 99401222, now seen corresponding path program 722 times [2020-02-10 20:50:32,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:32,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788206830] [2020-02-10 20:50:32,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:33,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788206830] [2020-02-10 20:50:33,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:33,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:33,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155376072] [2020-02-10 20:50:33,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:33,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:33,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:33,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:33,043 INFO L87 Difference]: Start difference. First operand 1581 states and 7101 transitions. Second operand 11 states. [2020-02-10 20:50:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:33,308 INFO L93 Difference]: Finished difference Result 2969 states and 11771 transitions. [2020-02-10 20:50:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:33,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:33,316 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:50:33,316 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:50:33,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:50:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1576. [2020-02-10 20:50:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:50:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7087 transitions. [2020-02-10 20:50:33,384 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7087 transitions. Word has length 28 [2020-02-10 20:50:33,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:33,384 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7087 transitions. [2020-02-10 20:50:33,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7087 transitions. [2020-02-10 20:50:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:33,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:33,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:33,387 INFO L427 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash 965639682, now seen corresponding path program 723 times [2020-02-10 20:50:33,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:33,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831212088] [2020-02-10 20:50:33,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:33,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831212088] [2020-02-10 20:50:33,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:33,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:33,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471543785] [2020-02-10 20:50:33,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:33,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:33,935 INFO L87 Difference]: Start difference. First operand 1576 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:50:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:34,215 INFO L93 Difference]: Finished difference Result 2973 states and 11778 transitions. [2020-02-10 20:50:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:34,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:34,222 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:50:34,222 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:50:34,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:50:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1582. [2020-02-10 20:50:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:50:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7098 transitions. [2020-02-10 20:50:34,291 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7098 transitions. Word has length 28 [2020-02-10 20:50:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:34,291 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7098 transitions. [2020-02-10 20:50:34,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7098 transitions. [2020-02-10 20:50:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:34,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:34,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:34,294 INFO L427 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1839922618, now seen corresponding path program 724 times [2020-02-10 20:50:34,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:34,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249975906] [2020-02-10 20:50:34,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:34,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249975906] [2020-02-10 20:50:34,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:34,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:34,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762131830] [2020-02-10 20:50:34,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:34,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:34,835 INFO L87 Difference]: Start difference. First operand 1582 states and 7098 transitions. Second operand 11 states. [2020-02-10 20:50:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:35,008 INFO L93 Difference]: Finished difference Result 2978 states and 11782 transitions. [2020-02-10 20:50:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:35,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:35,016 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:50:35,016 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:50:35,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:50:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1576. [2020-02-10 20:50:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:50:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7081 transitions. [2020-02-10 20:50:35,085 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7081 transitions. Word has length 28 [2020-02-10 20:50:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:35,085 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7081 transitions. [2020-02-10 20:50:35,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7081 transitions. [2020-02-10 20:50:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:35,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:35,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:35,088 INFO L427 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash -973684158, now seen corresponding path program 725 times [2020-02-10 20:50:35,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:35,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140684171] [2020-02-10 20:50:35,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:35,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140684171] [2020-02-10 20:50:35,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:35,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:35,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106976144] [2020-02-10 20:50:35,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:35,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:35,639 INFO L87 Difference]: Start difference. First operand 1576 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:50:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:35,833 INFO L93 Difference]: Finished difference Result 2976 states and 11779 transitions. [2020-02-10 20:50:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:35,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:35,841 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:50:35,841 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:50:35,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:50:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1583. [2020-02-10 20:50:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:50:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7094 transitions. [2020-02-10 20:50:35,908 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7094 transitions. Word has length 28 [2020-02-10 20:50:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:35,908 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7094 transitions. [2020-02-10 20:50:35,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7094 transitions. [2020-02-10 20:50:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:35,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:35,910 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:35,910 INFO L427 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash -228981660, now seen corresponding path program 726 times [2020-02-10 20:50:35,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794373186] [2020-02-10 20:50:35,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:36,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794373186] [2020-02-10 20:50:36,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:36,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:36,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285520843] [2020-02-10 20:50:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:36,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:36,473 INFO L87 Difference]: Start difference. First operand 1583 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:50:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:36,711 INFO L93 Difference]: Finished difference Result 2980 states and 11780 transitions. [2020-02-10 20:50:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:36,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:36,718 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:50:36,719 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:50:36,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:50:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1570. [2020-02-10 20:50:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:50:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7064 transitions. [2020-02-10 20:50:36,785 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7064 transitions. Word has length 28 [2020-02-10 20:50:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:36,785 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7064 transitions. [2020-02-10 20:50:36,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7064 transitions. [2020-02-10 20:50:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:36,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:36,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:36,788 INFO L427 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash 74711198, now seen corresponding path program 727 times [2020-02-10 20:50:36,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:36,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16007740] [2020-02-10 20:50:36,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:37,324 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:50:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:37,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16007740] [2020-02-10 20:50:37,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:37,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:37,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317165788] [2020-02-10 20:50:37,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:37,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:37,332 INFO L87 Difference]: Start difference. First operand 1570 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:50:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:37,534 INFO L93 Difference]: Finished difference Result 2963 states and 11758 transitions. [2020-02-10 20:50:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:37,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:37,542 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:50:37,542 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:50:37,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:50:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 20:50:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7092 transitions. [2020-02-10 20:50:37,610 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7092 transitions. Word has length 28 [2020-02-10 20:50:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:37,610 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7092 transitions. [2020-02-10 20:50:37,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7092 transitions. [2020-02-10 20:50:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:37,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:37,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] [2020-02-10 20:50:37,613 INFO L427 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 819413696, now seen corresponding path program 728 times [2020-02-10 20:50:37,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:37,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870450416] [2020-02-10 20:50:37,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:38,149 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:50:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:38,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870450416] [2020-02-10 20:50:38,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:38,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:38,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436031769] [2020-02-10 20:50:38,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:38,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:38,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:38,157 INFO L87 Difference]: Start difference. First operand 1580 states and 7092 transitions. Second operand 11 states. [2020-02-10 20:50:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:38,427 INFO L93 Difference]: Finished difference Result 2964 states and 11755 transitions. [2020-02-10 20:50:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:38,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:38,435 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 20:50:38,435 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:50:38,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:50:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1575. [2020-02-10 20:50:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7078 transitions. [2020-02-10 20:50:38,501 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7078 transitions. Word has length 28 [2020-02-10 20:50:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:38,501 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7078 transitions. [2020-02-10 20:50:38,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7078 transitions. [2020-02-10 20:50:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:38,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:38,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] [2020-02-10 20:50:38,504 INFO L427 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash -998374182, now seen corresponding path program 729 times [2020-02-10 20:50:38,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:38,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104113164] [2020-02-10 20:50:38,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:39,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104113164] [2020-02-10 20:50:39,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:39,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:39,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56722605] [2020-02-10 20:50:39,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:39,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:39,024 INFO L87 Difference]: Start difference. First operand 1575 states and 7078 transitions. Second operand 11 states. [2020-02-10 20:50:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:39,290 INFO L93 Difference]: Finished difference Result 2965 states and 11757 transitions. [2020-02-10 20:50:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:39,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:39,298 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:50:39,298 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:50:39,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:50:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 20:50:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7087 transitions. [2020-02-10 20:50:39,364 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7087 transitions. Word has length 28 [2020-02-10 20:50:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:39,364 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7087 transitions. [2020-02-10 20:50:39,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7087 transitions. [2020-02-10 20:50:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:39,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:39,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] [2020-02-10 20:50:39,367 INFO L427 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1235733312, now seen corresponding path program 730 times [2020-02-10 20:50:39,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:39,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123102701] [2020-02-10 20:50:39,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:39,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123102701] [2020-02-10 20:50:39,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:39,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:39,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335938106] [2020-02-10 20:50:39,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:39,912 INFO L87 Difference]: Start difference. First operand 1580 states and 7087 transitions. Second operand 11 states. [2020-02-10 20:50:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:40,114 INFO L93 Difference]: Finished difference Result 2968 states and 11758 transitions. [2020-02-10 20:50:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:40,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:40,122 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:50:40,122 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:50:40,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:50:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1575. [2020-02-10 20:50:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7073 transitions. [2020-02-10 20:50:40,189 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7073 transitions. Word has length 28 [2020-02-10 20:50:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:40,189 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7073 transitions. [2020-02-10 20:50:40,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7073 transitions. [2020-02-10 20:50:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:40,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:40,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] [2020-02-10 20:50:40,191 INFO L427 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1357269274, now seen corresponding path program 731 times [2020-02-10 20:50:40,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:40,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105720301] [2020-02-10 20:50:40,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:40,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105720301] [2020-02-10 20:50:40,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:40,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:40,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902905617] [2020-02-10 20:50:40,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:40,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:40,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:40,743 INFO L87 Difference]: Start difference. First operand 1575 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:50:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:41,006 INFO L93 Difference]: Finished difference Result 2968 states and 11759 transitions. [2020-02-10 20:50:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:41,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:41,013 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 20:50:41,013 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:50:41,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:50:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 20:50:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:50:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7084 transitions. [2020-02-10 20:50:41,080 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7084 transitions. Word has length 28 [2020-02-10 20:50:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:41,080 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7084 transitions. [2020-02-10 20:50:41,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7084 transitions. [2020-02-10 20:50:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:41,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:41,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:41,083 INFO L427 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1448293026, now seen corresponding path program 732 times [2020-02-10 20:50:41,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:41,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840250456] [2020-02-10 20:50:41,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:41,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840250456] [2020-02-10 20:50:41,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:41,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:41,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700625766] [2020-02-10 20:50:41,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:41,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:41,624 INFO L87 Difference]: Start difference. First operand 1581 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:50:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:41,801 INFO L93 Difference]: Finished difference Result 2970 states and 11757 transitions. [2020-02-10 20:50:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:41,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:41,809 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:50:41,809 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:50:41,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:50:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1570. [2020-02-10 20:50:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:50:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7059 transitions. [2020-02-10 20:50:41,878 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7059 transitions. Word has length 28 [2020-02-10 20:50:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:41,878 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7059 transitions. [2020-02-10 20:50:41,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7059 transitions. [2020-02-10 20:50:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:41,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:41,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] [2020-02-10 20:50:41,881 INFO L427 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 85214302, now seen corresponding path program 733 times [2020-02-10 20:50:41,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:41,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009888067] [2020-02-10 20:50:41,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:42,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009888067] [2020-02-10 20:50:42,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:42,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:42,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105364314] [2020-02-10 20:50:42,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:42,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:42,415 INFO L87 Difference]: Start difference. First operand 1570 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:50:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:42,600 INFO L93 Difference]: Finished difference Result 2979 states and 11785 transitions. [2020-02-10 20:50:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:42,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:42,608 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:50:42,609 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:50:42,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:50:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1583. [2020-02-10 20:50:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:50:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7094 transitions. [2020-02-10 20:50:42,676 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7094 transitions. Word has length 28 [2020-02-10 20:50:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:42,676 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7094 transitions. [2020-02-10 20:50:42,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7094 transitions. [2020-02-10 20:50:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:42,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:42,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:42,679 INFO L427 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1574619298, now seen corresponding path program 734 times [2020-02-10 20:50:42,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:42,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284098551] [2020-02-10 20:50:42,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:43,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284098551] [2020-02-10 20:50:43,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:43,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:43,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617138802] [2020-02-10 20:50:43,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:43,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:43,213 INFO L87 Difference]: Start difference. First operand 1583 states and 7094 transitions. Second operand 11 states. [2020-02-10 20:50:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:43,348 INFO L93 Difference]: Finished difference Result 2984 states and 11789 transitions. [2020-02-10 20:50:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:43,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:43,356 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 20:50:43,356 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:50:43,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:50:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1577. [2020-02-10 20:50:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:50:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7077 transitions. [2020-02-10 20:50:43,422 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7077 transitions. Word has length 28 [2020-02-10 20:50:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:43,423 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7077 transitions. [2020-02-10 20:50:43,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7077 transitions. [2020-02-10 20:50:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:43,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:43,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:43,425 INFO L427 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1696155260, now seen corresponding path program 735 times [2020-02-10 20:50:43,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:43,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743058743] [2020-02-10 20:50:43,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:43,957 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:50:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:43,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743058743] [2020-02-10 20:50:43,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:43,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:43,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541579512] [2020-02-10 20:50:43,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:43,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:43,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:43,964 INFO L87 Difference]: Start difference. First operand 1577 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:50:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:44,138 INFO L93 Difference]: Finished difference Result 2976 states and 11774 transitions. [2020-02-10 20:50:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:44,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:44,146 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:50:44,146 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:50:44,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:50:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1582. [2020-02-10 20:50:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:50:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7086 transitions. [2020-02-10 20:50:44,212 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7086 transitions. Word has length 28 [2020-02-10 20:50:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:44,213 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7086 transitions. [2020-02-10 20:50:44,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7086 transitions. [2020-02-10 20:50:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:44,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:44,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] [2020-02-10 20:50:44,215 INFO L427 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -364704542, now seen corresponding path program 736 times [2020-02-10 20:50:44,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:44,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974300421] [2020-02-10 20:50:44,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:44,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974300421] [2020-02-10 20:50:44,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:44,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:44,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214662681] [2020-02-10 20:50:44,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:44,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:44,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:44,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:44,746 INFO L87 Difference]: Start difference. First operand 1582 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:50:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:44,935 INFO L93 Difference]: Finished difference Result 2979 states and 11775 transitions. [2020-02-10 20:50:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:44,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:44,943 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:50:44,944 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:50:44,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:50:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1577. [2020-02-10 20:50:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:50:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 20:50:45,010 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 20:50:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:45,010 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 20:50:45,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 20:50:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:45,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:45,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] [2020-02-10 20:50:45,013 INFO L427 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2112474876, now seen corresponding path program 737 times [2020-02-10 20:50:45,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:45,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923542331] [2020-02-10 20:50:45,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:45,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923542331] [2020-02-10 20:50:45,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:45,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:45,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542177510] [2020-02-10 20:50:45,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:45,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:45,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:45,569 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:50:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:45,723 INFO L93 Difference]: Finished difference Result 2991 states and 11799 transitions. [2020-02-10 20:50:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:45,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:45,731 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:50:45,731 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:50:45,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:50:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1587. [2020-02-10 20:50:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:50:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7089 transitions. [2020-02-10 20:50:45,798 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7089 transitions. Word has length 28 [2020-02-10 20:50:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:45,798 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7089 transitions. [2020-02-10 20:50:45,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7089 transitions. [2020-02-10 20:50:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:45,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:45,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:45,801 INFO L427 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1437789922, now seen corresponding path program 738 times [2020-02-10 20:50:45,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:45,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787254535] [2020-02-10 20:50:45,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:46,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 20:50:46,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787254535] [2020-02-10 20:50:46,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:46,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:46,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981209192] [2020-02-10 20:50:46,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:46,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:46,346 INFO L87 Difference]: Start difference. First operand 1587 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:50:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:46,528 INFO L93 Difference]: Finished difference Result 2989 states and 11787 transitions. [2020-02-10 20:50:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:46,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:46,536 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:50:46,536 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:50:46,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:50:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1570. [2020-02-10 20:50:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:50:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:50:46,603 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:50:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:46,604 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:50:46,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:50:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:46,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:46,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] [2020-02-10 20:50:46,606 INFO L427 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash 840419904, now seen corresponding path program 739 times [2020-02-10 20:50:46,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:46,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306147200] [2020-02-10 20:50:46,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:47,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306147200] [2020-02-10 20:50:47,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:47,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:47,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750984513] [2020-02-10 20:50:47,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:47,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:47,146 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:50:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:47,334 INFO L93 Difference]: Finished difference Result 2986 states and 11797 transitions. [2020-02-10 20:50:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:47,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:47,342 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:50:47,342 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:50:47,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:50:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1585. [2020-02-10 20:50:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:50:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7093 transitions. [2020-02-10 20:50:47,408 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7093 transitions. Word has length 28 [2020-02-10 20:50:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:47,409 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7093 transitions. [2020-02-10 20:50:47,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7093 transitions. [2020-02-10 20:50:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:47,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:47,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:47,411 INFO L427 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:47,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1585122402, now seen corresponding path program 740 times [2020-02-10 20:50:47,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962079263] [2020-02-10 20:50:47,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:47,950 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:50:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:47,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962079263] [2020-02-10 20:50:47,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:47,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:47,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130252243] [2020-02-10 20:50:47,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:47,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:47,958 INFO L87 Difference]: Start difference. First operand 1585 states and 7093 transitions. Second operand 11 states. [2020-02-10 20:50:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:48,093 INFO L93 Difference]: Finished difference Result 2990 states and 11798 transitions. [2020-02-10 20:50:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:48,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:48,101 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:50:48,101 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 20:50:48,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 20:50:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1578. [2020-02-10 20:50:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:50:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:50:48,169 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:50:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:48,169 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:50:48,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:50:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:48,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:48,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:48,172 INFO L427 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1843606434, now seen corresponding path program 741 times [2020-02-10 20:50:48,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:48,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831715466] [2020-02-10 20:50:48,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:48,704 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:50:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:48,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831715466] [2020-02-10 20:50:48,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:48,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:48,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795245922] [2020-02-10 20:50:48,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:48,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:48,712 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:50:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:48,886 INFO L93 Difference]: Finished difference Result 2983 states and 11785 transitions. [2020-02-10 20:50:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:48,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:48,894 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 20:50:48,894 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:50:48,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:50:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1584. [2020-02-10 20:50:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:50:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7084 transitions. [2020-02-10 20:50:48,962 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7084 transitions. Word has length 28 [2020-02-10 20:50:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:48,962 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7084 transitions. [2020-02-10 20:50:48,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7084 transitions. [2020-02-10 20:50:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:48,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:48,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:48,964 INFO L427 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:48,965 INFO L82 PathProgramCache]: Analyzing trace with hash -354201438, now seen corresponding path program 742 times [2020-02-10 20:50:48,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:48,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720248939] [2020-02-10 20:50:48,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:49,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720248939] [2020-02-10 20:50:49,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:49,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:49,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296795166] [2020-02-10 20:50:49,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:49,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:49,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:49,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:49,503 INFO L87 Difference]: Start difference. First operand 1584 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:50:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:49,707 INFO L93 Difference]: Finished difference Result 2985 states and 11783 transitions. [2020-02-10 20:50:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:49,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:49,715 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:50:49,715 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 20:50:49,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 20:50:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1578. [2020-02-10 20:50:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:50:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 20:50:49,781 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 20:50:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:49,782 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 20:50:49,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 20:50:49,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:49,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:49,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:49,784 INFO L427 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash 512037022, now seen corresponding path program 743 times [2020-02-10 20:50:49,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:49,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367104350] [2020-02-10 20:50:49,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:50,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367104350] [2020-02-10 20:50:50,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:50,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:50,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490748598] [2020-02-10 20:50:50,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:50,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:50,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:50,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:50,345 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:50:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:50,486 INFO L93 Difference]: Finished difference Result 2995 states and 11802 transitions. [2020-02-10 20:50:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:50,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:50,494 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:50:50,494 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:50:50,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:50:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1588. [2020-02-10 20:50:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:50:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7084 transitions. [2020-02-10 20:50:50,561 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7084 transitions. Word has length 28 [2020-02-10 20:50:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:50,562 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7084 transitions. [2020-02-10 20:50:50,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7084 transitions. [2020-02-10 20:50:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:50,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:50,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] [2020-02-10 20:50:50,564 INFO L427 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1256739520, now seen corresponding path program 744 times [2020-02-10 20:50:50,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:50,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514215189] [2020-02-10 20:50:50,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:51,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514215189] [2020-02-10 20:50:51,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:51,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:51,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120007918] [2020-02-10 20:50:51,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:51,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:51,108 INFO L87 Difference]: Start difference. First operand 1588 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:50:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:51,292 INFO L93 Difference]: Finished difference Result 2993 states and 11790 transitions. [2020-02-10 20:50:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:51,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:51,300 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:50:51,300 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:50:51,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:50:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1563. [2020-02-10 20:50:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:50:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7032 transitions. [2020-02-10 20:50:51,368 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7032 transitions. Word has length 28 [2020-02-10 20:50:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:51,368 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7032 transitions. [2020-02-10 20:50:51,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7032 transitions. [2020-02-10 20:50:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:51,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:51,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] [2020-02-10 20:50:51,370 INFO L427 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash -725043348, now seen corresponding path program 745 times [2020-02-10 20:50:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:51,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356146727] [2020-02-10 20:50:51,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:51,896 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 20:50:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:51,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356146727] [2020-02-10 20:50:51,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:51,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:51,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841670950] [2020-02-10 20:50:51,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:51,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:51,904 INFO L87 Difference]: Start difference. First operand 1563 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:50:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:52,104 INFO L93 Difference]: Finished difference Result 2962 states and 11754 transitions. [2020-02-10 20:50:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:52,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:52,112 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:50:52,112 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 20:50:52,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 20:50:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1580. [2020-02-10 20:50:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:50:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7091 transitions. [2020-02-10 20:50:52,179 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7091 transitions. Word has length 28 [2020-02-10 20:50:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:52,179 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7091 transitions. [2020-02-10 20:50:52,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7091 transitions. [2020-02-10 20:50:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:52,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:52,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] [2020-02-10 20:50:52,182 INFO L427 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 19659150, now seen corresponding path program 746 times [2020-02-10 20:50:52,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:52,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650567591] [2020-02-10 20:50:52,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:52,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650567591] [2020-02-10 20:50:52,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:52,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:52,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340103218] [2020-02-10 20:50:52,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:52,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:52,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:52,720 INFO L87 Difference]: Start difference. First operand 1580 states and 7091 transitions. Second operand 11 states. [2020-02-10 20:50:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:52,897 INFO L93 Difference]: Finished difference Result 2963 states and 11751 transitions. [2020-02-10 20:50:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:52,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:52,904 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:50:52,904 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:50:52,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:50:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1575. [2020-02-10 20:50:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7077 transitions. [2020-02-10 20:50:52,972 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7077 transitions. Word has length 28 [2020-02-10 20:50:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:52,972 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7077 transitions. [2020-02-10 20:50:52,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7077 transitions. [2020-02-10 20:50:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:52,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:52,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] [2020-02-10 20:50:52,975 INFO L427 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 885897610, now seen corresponding path program 747 times [2020-02-10 20:50:52,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:52,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465779375] [2020-02-10 20:50:52,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:53,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465779375] [2020-02-10 20:50:53,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:53,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:53,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193300980] [2020-02-10 20:50:53,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:53,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:53,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:53,500 INFO L87 Difference]: Start difference. First operand 1575 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:50:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:53,677 INFO L93 Difference]: Finished difference Result 2967 states and 11758 transitions. [2020-02-10 20:50:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:53,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:53,685 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:50:53,685 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:50:53,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:50:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 20:50:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:50:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7088 transitions. [2020-02-10 20:50:53,754 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7088 transitions. Word has length 28 [2020-02-10 20:50:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:53,754 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7088 transitions. [2020-02-10 20:50:53,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7088 transitions. [2020-02-10 20:50:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:53,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:53,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] [2020-02-10 20:50:53,757 INFO L427 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:53,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1919664690, now seen corresponding path program 748 times [2020-02-10 20:50:53,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:53,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557030451] [2020-02-10 20:50:53,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:54,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557030451] [2020-02-10 20:50:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:54,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:54,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956776551] [2020-02-10 20:50:54,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:54,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:54,291 INFO L87 Difference]: Start difference. First operand 1581 states and 7088 transitions. Second operand 11 states. [2020-02-10 20:50:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:54,454 INFO L93 Difference]: Finished difference Result 2972 states and 11762 transitions. [2020-02-10 20:50:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:54,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:54,461 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:50:54,461 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 20:50:54,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 20:50:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1575. [2020-02-10 20:50:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:50:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 20:50:54,530 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 20:50:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:54,530 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 20:50:54,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 20:50:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:54,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:54,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:54,533 INFO L427 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:54,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1053426230, now seen corresponding path program 749 times [2020-02-10 20:50:54,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:54,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040442634] [2020-02-10 20:50:54,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:55,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040442634] [2020-02-10 20:50:55,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:55,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:55,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295882968] [2020-02-10 20:50:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:55,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:55,051 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:50:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:55,228 INFO L93 Difference]: Finished difference Result 2970 states and 11759 transitions. [2020-02-10 20:50:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:55,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:55,235 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 20:50:55,235 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:50:55,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:50:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1582. [2020-02-10 20:50:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:50:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7084 transitions. [2020-02-10 20:50:55,302 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7084 transitions. Word has length 28 [2020-02-10 20:50:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:55,302 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7084 transitions. [2020-02-10 20:50:55,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7084 transitions. [2020-02-10 20:50:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:55,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:55,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:55,305 INFO L427 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:55,305 INFO L82 PathProgramCache]: Analyzing trace with hash -308723732, now seen corresponding path program 750 times [2020-02-10 20:50:55,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:55,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939931595] [2020-02-10 20:50:55,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:55,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939931595] [2020-02-10 20:50:55,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:55,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:55,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22520611] [2020-02-10 20:50:55,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:55,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:55,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:55,840 INFO L87 Difference]: Start difference. First operand 1582 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:50:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:56,017 INFO L93 Difference]: Finished difference Result 2974 states and 11760 transitions. [2020-02-10 20:50:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:56,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:56,025 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:50:56,025 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:50:56,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:50:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1569. [2020-02-10 20:50:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:50:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7054 transitions. [2020-02-10 20:50:56,091 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7054 transitions. Word has length 28 [2020-02-10 20:50:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:56,092 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7054 transitions. [2020-02-10 20:50:56,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7054 transitions. [2020-02-10 20:50:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:56,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:56,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] [2020-02-10 20:50:56,094 INFO L427 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1550256474, now seen corresponding path program 751 times [2020-02-10 20:50:56,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:56,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947773607] [2020-02-10 20:50:56,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:56,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947773607] [2020-02-10 20:50:56,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:56,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:56,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782352185] [2020-02-10 20:50:56,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:56,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:56,628 INFO L87 Difference]: Start difference. First operand 1569 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:50:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:56,819 INFO L93 Difference]: Finished difference Result 2956 states and 11736 transitions. [2020-02-10 20:50:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:56,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:56,827 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 20:50:56,827 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:50:56,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:50:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1579. [2020-02-10 20:50:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:50:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7082 transitions. [2020-02-10 20:50:56,894 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7082 transitions. Word has length 28 [2020-02-10 20:50:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:56,894 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7082 transitions. [2020-02-10 20:50:56,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7082 transitions. [2020-02-10 20:50:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:56,897 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:56,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:56,897 INFO L427 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash -805553976, now seen corresponding path program 752 times [2020-02-10 20:50:56,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:56,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318389422] [2020-02-10 20:50:56,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:57,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318389422] [2020-02-10 20:50:57,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:57,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:57,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343577093] [2020-02-10 20:50:57,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:57,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:57,430 INFO L87 Difference]: Start difference. First operand 1579 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:50:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:57,605 INFO L93 Difference]: Finished difference Result 2957 states and 11733 transitions. [2020-02-10 20:50:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:57,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:57,613 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:50:57,613 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:50:57,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:50:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1574. [2020-02-10 20:50:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:50:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7068 transitions. [2020-02-10 20:50:57,679 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7068 transitions. Word has length 28 [2020-02-10 20:50:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:57,680 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7068 transitions. [2020-02-10 20:50:57,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7068 transitions. [2020-02-10 20:50:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:57,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:57,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:57,682 INFO L427 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:57,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:57,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1136395640, now seen corresponding path program 753 times [2020-02-10 20:50:57,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:57,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394155054] [2020-02-10 20:50:57,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:58,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394155054] [2020-02-10 20:50:58,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:58,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:58,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149999765] [2020-02-10 20:50:58,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:58,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:58,218 INFO L87 Difference]: Start difference. First operand 1574 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:50:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:58,440 INFO L93 Difference]: Finished difference Result 2957 states and 11733 transitions. [2020-02-10 20:50:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:58,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:58,448 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 20:50:58,448 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:50:58,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:50:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1579. [2020-02-10 20:50:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:50:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7077 transitions. [2020-02-10 20:50:58,515 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7077 transitions. Word has length 28 [2020-02-10 20:50:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:58,516 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7077 transitions. [2020-02-10 20:50:58,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7077 transitions. [2020-02-10 20:50:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:58,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:58,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:58,518 INFO L427 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1495918968, now seen corresponding path program 754 times [2020-02-10 20:50:58,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:58,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799479575] [2020-02-10 20:50:58,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:59,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799479575] [2020-02-10 20:50:59,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:59,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:59,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238666048] [2020-02-10 20:50:59,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:59,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:59,085 INFO L87 Difference]: Start difference. First operand 1579 states and 7077 transitions. Second operand 11 states. [2020-02-10 20:50:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:59,307 INFO L93 Difference]: Finished difference Result 2959 states and 11732 transitions. [2020-02-10 20:50:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:50:59,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:50:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:59,315 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:50:59,315 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:50:59,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:50:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:50:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1574. [2020-02-10 20:50:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:50:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 20:50:59,381 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 20:50:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:59,381 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 20:50:59,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:50:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 20:50:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:50:59,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:59,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:59,384 INFO L427 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:50:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -802928200, now seen corresponding path program 755 times [2020-02-10 20:50:59,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:59,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382261791] [2020-02-10 20:50:59,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:59,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382261791] [2020-02-10 20:50:59,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:59,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:50:59,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669105011] [2020-02-10 20:50:59,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:50:59,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:59,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:50:59,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:59,919 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:51:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:00,097 INFO L93 Difference]: Finished difference Result 2960 states and 11735 transitions. [2020-02-10 20:51:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:00,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:00,105 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 20:51:00,105 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:51:00,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:51:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1580. [2020-02-10 20:51:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7074 transitions. [2020-02-10 20:51:00,173 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7074 transitions. Word has length 28 [2020-02-10 20:51:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:00,173 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7074 transitions. [2020-02-10 20:51:00,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7074 transitions. [2020-02-10 20:51:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:00,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:00,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:00,175 INFO L427 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 115021990, now seen corresponding path program 756 times [2020-02-10 20:51:00,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:00,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140225779] [2020-02-10 20:51:00,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:00,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140225779] [2020-02-10 20:51:00,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:00,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:00,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962837528] [2020-02-10 20:51:00,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:00,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:00,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:00,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:00,704 INFO L87 Difference]: Start difference. First operand 1580 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:51:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:00,881 INFO L93 Difference]: Finished difference Result 2961 states and 11731 transitions. [2020-02-10 20:51:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:00,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:00,889 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:51:00,889 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:51:00,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:51:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1569. [2020-02-10 20:51:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:51:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7049 transitions. [2020-02-10 20:51:00,955 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7049 transitions. Word has length 28 [2020-02-10 20:51:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:00,955 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7049 transitions. [2020-02-10 20:51:00,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7049 transitions. [2020-02-10 20:51:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:00,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:00,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:00,958 INFO L427 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1539753370, now seen corresponding path program 757 times [2020-02-10 20:51:00,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:00,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797678749] [2020-02-10 20:51:00,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:01,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797678749] [2020-02-10 20:51:01,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:01,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:01,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044504114] [2020-02-10 20:51:01,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:01,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:01,509 INFO L87 Difference]: Start difference. First operand 1569 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:51:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:01,687 INFO L93 Difference]: Finished difference Result 2969 states and 11757 transitions. [2020-02-10 20:51:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:01,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:01,694 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 20:51:01,694 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 20:51:01,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 20:51:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1581. [2020-02-10 20:51:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7082 transitions. [2020-02-10 20:51:01,760 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7082 transitions. Word has length 28 [2020-02-10 20:51:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:01,761 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7082 transitions. [2020-02-10 20:51:01,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7082 transitions. [2020-02-10 20:51:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:01,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:01,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:01,763 INFO L427 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash -50348374, now seen corresponding path program 758 times [2020-02-10 20:51:01,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:01,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345119340] [2020-02-10 20:51:01,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:02,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345119340] [2020-02-10 20:51:02,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:02,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:02,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138648990] [2020-02-10 20:51:02,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:02,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:02,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:02,291 INFO L87 Difference]: Start difference. First operand 1581 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:51:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:02,431 INFO L93 Difference]: Finished difference Result 2974 states and 11761 transitions. [2020-02-10 20:51:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:02,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:02,440 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:51:02,440 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 20:51:02,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 20:51:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1575. [2020-02-10 20:51:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:51:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7065 transitions. [2020-02-10 20:51:02,509 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7065 transitions. Word has length 28 [2020-02-10 20:51:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:02,509 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7065 transitions. [2020-02-10 20:51:02,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7065 transitions. [2020-02-10 20:51:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:02,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:02,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:02,512 INFO L427 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash -464042214, now seen corresponding path program 759 times [2020-02-10 20:51:02,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:02,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906208870] [2020-02-10 20:51:02,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:03,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906208870] [2020-02-10 20:51:03,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:03,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:03,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337898639] [2020-02-10 20:51:03,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:03,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:03,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:03,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:03,040 INFO L87 Difference]: Start difference. First operand 1575 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:51:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:03,214 INFO L93 Difference]: Finished difference Result 2965 states and 11744 transitions. [2020-02-10 20:51:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:03,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:03,222 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 20:51:03,222 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:51:03,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:51:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 20:51:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7074 transitions. [2020-02-10 20:51:03,318 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7074 transitions. Word has length 28 [2020-02-10 20:51:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:03,319 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7074 transitions. [2020-02-10 20:51:03,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7074 transitions. [2020-02-10 20:51:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:03,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:03,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] [2020-02-10 20:51:03,321 INFO L427 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1198610474, now seen corresponding path program 760 times [2020-02-10 20:51:03,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:03,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019070129] [2020-02-10 20:51:03,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:03,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019070129] [2020-02-10 20:51:03,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:03,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:03,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232697629] [2020-02-10 20:51:03,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:03,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:03,842 INFO L87 Difference]: Start difference. First operand 1580 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:51:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:04,064 INFO L93 Difference]: Finished difference Result 2967 states and 11743 transitions. [2020-02-10 20:51:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:04,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:04,071 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 20:51:04,072 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:51:04,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:51:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1575. [2020-02-10 20:51:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:51:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7060 transitions. [2020-02-10 20:51:04,140 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7060 transitions. Word has length 28 [2020-02-10 20:51:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:04,140 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7060 transitions. [2020-02-10 20:51:04,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7060 transitions. [2020-02-10 20:51:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:04,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:04,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] [2020-02-10 20:51:04,143 INFO L427 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash -47722598, now seen corresponding path program 761 times [2020-02-10 20:51:04,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:04,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999295818] [2020-02-10 20:51:04,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:04,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 20:51:04,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999295818] [2020-02-10 20:51:04,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:04,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:04,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145924944] [2020-02-10 20:51:04,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:04,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:04,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:04,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:04,676 INFO L87 Difference]: Start difference. First operand 1575 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:51:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:04,835 INFO L93 Difference]: Finished difference Result 2978 states and 11765 transitions. [2020-02-10 20:51:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:04,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:04,842 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 20:51:04,842 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:51:04,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:51:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1583. [2020-02-10 20:51:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:51:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7074 transitions. [2020-02-10 20:51:04,909 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7074 transitions. Word has length 28 [2020-02-10 20:51:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:04,909 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7074 transitions. [2020-02-10 20:51:04,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7074 transitions. [2020-02-10 20:51:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:04,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:04,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:04,912 INFO L427 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash 125525094, now seen corresponding path program 762 times [2020-02-10 20:51:04,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:04,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448871835] [2020-02-10 20:51:04,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:05,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448871835] [2020-02-10 20:51:05,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:05,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:05,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513445458] [2020-02-10 20:51:05,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:05,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:05,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:05,453 INFO L87 Difference]: Start difference. First operand 1583 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:51:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:05,664 INFO L93 Difference]: Finished difference Result 2975 states and 11752 transitions. [2020-02-10 20:51:05,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:05,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:05,672 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 20:51:05,672 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 20:51:05,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 20:51:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1569. [2020-02-10 20:51:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:51:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7043 transitions. [2020-02-10 20:51:05,738 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7043 transitions. Word has length 28 [2020-02-10 20:51:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:05,738 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7043 transitions. [2020-02-10 20:51:05,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7043 transitions. [2020-02-10 20:51:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:05,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:05,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:05,741 INFO L427 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash -784547768, now seen corresponding path program 763 times [2020-02-10 20:51:05,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:05,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889744697] [2020-02-10 20:51:05,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:06,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889744697] [2020-02-10 20:51:06,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:06,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:06,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685446879] [2020-02-10 20:51:06,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:06,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:06,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:06,281 INFO L87 Difference]: Start difference. First operand 1569 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:51:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:06,459 INFO L93 Difference]: Finished difference Result 2976 states and 11770 transitions. [2020-02-10 20:51:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:06,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:06,467 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:51:06,467 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:51:06,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:51:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1583. [2020-02-10 20:51:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:51:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7082 transitions. [2020-02-10 20:51:06,534 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7082 transitions. Word has length 28 [2020-02-10 20:51:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:06,534 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7082 transitions. [2020-02-10 20:51:06,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7082 transitions. [2020-02-10 20:51:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:06,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:06,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] [2020-02-10 20:51:06,536 INFO L427 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -39845270, now seen corresponding path program 764 times [2020-02-10 20:51:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:06,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494602113] [2020-02-10 20:51:06,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:07,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494602113] [2020-02-10 20:51:07,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:07,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:07,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814794503] [2020-02-10 20:51:07,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:07,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:07,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:07,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:07,083 INFO L87 Difference]: Start difference. First operand 1583 states and 7082 transitions. Second operand 11 states. [2020-02-10 20:51:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:07,232 INFO L93 Difference]: Finished difference Result 2980 states and 11771 transitions. [2020-02-10 20:51:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:07,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:07,240 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:51:07,240 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:51:07,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:51:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1576. [2020-02-10 20:51:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:51:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7062 transitions. [2020-02-10 20:51:07,307 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7062 transitions. Word has length 28 [2020-02-10 20:51:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:07,307 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7062 transitions. [2020-02-10 20:51:07,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7062 transitions. [2020-02-10 20:51:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:07,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:07,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:07,310 INFO L427 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 291163388, now seen corresponding path program 765 times [2020-02-10 20:51:07,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:07,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741492241] [2020-02-10 20:51:07,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:07,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741492241] [2020-02-10 20:51:07,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:07,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:07,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416486451] [2020-02-10 20:51:07,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:07,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:07,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:07,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:07,843 INFO L87 Difference]: Start difference. First operand 1576 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:51:08,061 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-02-10 20:51:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:08,075 INFO L93 Difference]: Finished difference Result 2972 states and 11756 transitions. [2020-02-10 20:51:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:08,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:08,083 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:51:08,083 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:51:08,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:51:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1582. [2020-02-10 20:51:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:51:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7073 transitions. [2020-02-10 20:51:08,149 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7073 transitions. Word has length 28 [2020-02-10 20:51:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:08,149 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7073 transitions. [2020-02-10 20:51:08,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7073 transitions. [2020-02-10 20:51:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:08,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:08,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] [2020-02-10 20:51:08,151 INFO L427 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1209113578, now seen corresponding path program 766 times [2020-02-10 20:51:08,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:08,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455601156] [2020-02-10 20:51:08,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:08,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455601156] [2020-02-10 20:51:08,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:08,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:08,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401915529] [2020-02-10 20:51:08,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:08,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:08,679 INFO L87 Difference]: Start difference. First operand 1582 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:51:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:08,899 INFO L93 Difference]: Finished difference Result 2973 states and 11752 transitions. [2020-02-10 20:51:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:08,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:08,906 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:51:08,906 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:51:08,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:51:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1576. [2020-02-10 20:51:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:51:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7056 transitions. [2020-02-10 20:51:08,973 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7056 transitions. Word has length 28 [2020-02-10 20:51:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:08,973 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7056 transitions. [2020-02-10 20:51:08,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7056 transitions. [2020-02-10 20:51:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:08,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:08,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:08,976 INFO L427 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1648160452, now seen corresponding path program 767 times [2020-02-10 20:51:08,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:08,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91579848] [2020-02-10 20:51:08,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:09,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91579848] [2020-02-10 20:51:09,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:09,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:09,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778649300] [2020-02-10 20:51:09,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:09,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:09,510 INFO L87 Difference]: Start difference. First operand 1576 states and 7056 transitions. Second operand 11 states. [2020-02-10 20:51:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:09,652 INFO L93 Difference]: Finished difference Result 2982 states and 11769 transitions. [2020-02-10 20:51:09,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:09,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:09,659 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:51:09,659 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:51:09,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:51:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1584. [2020-02-10 20:51:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:51:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7070 transitions. [2020-02-10 20:51:09,725 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7070 transitions. Word has length 28 [2020-02-10 20:51:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:09,725 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7070 transitions. [2020-02-10 20:51:09,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7070 transitions. [2020-02-10 20:51:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:09,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:09,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:09,728 INFO L427 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:09,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1474912760, now seen corresponding path program 768 times [2020-02-10 20:51:09,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:09,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402025852] [2020-02-10 20:51:09,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:10,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402025852] [2020-02-10 20:51:10,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:10,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:10,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052948945] [2020-02-10 20:51:10,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:10,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:10,259 INFO L87 Difference]: Start difference. First operand 1584 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:51:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:10,444 INFO L93 Difference]: Finished difference Result 2979 states and 11756 transitions. [2020-02-10 20:51:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:10,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:10,452 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:51:10,452 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:51:10,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:51:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1563. [2020-02-10 20:51:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:51:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7026 transitions. [2020-02-10 20:51:10,519 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7026 transitions. Word has length 28 [2020-02-10 20:51:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:10,519 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7026 transitions. [2020-02-10 20:51:10,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7026 transitions. [2020-02-10 20:51:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:10,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:10,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:10,521 INFO L427 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1292451582, now seen corresponding path program 769 times [2020-02-10 20:51:10,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:10,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152185159] [2020-02-10 20:51:10,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:11,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152185159] [2020-02-10 20:51:11,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:11,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:11,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354129961] [2020-02-10 20:51:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:11,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:11,055 INFO L87 Difference]: Start difference. First operand 1563 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:51:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:11,321 INFO L93 Difference]: Finished difference Result 2948 states and 11716 transitions. [2020-02-10 20:51:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:11,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:11,328 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:51:11,329 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:51:11,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:51:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1578. [2020-02-10 20:51:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7078 transitions. [2020-02-10 20:51:11,394 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7078 transitions. Word has length 28 [2020-02-10 20:51:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:11,395 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7078 transitions. [2020-02-10 20:51:11,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7078 transitions. [2020-02-10 20:51:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:11,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:11,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:11,397 INFO L427 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:11,397 INFO L82 PathProgramCache]: Analyzing trace with hash -547749084, now seen corresponding path program 770 times [2020-02-10 20:51:11,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:11,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285047808] [2020-02-10 20:51:11,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:11,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285047808] [2020-02-10 20:51:11,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:11,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:11,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379131341] [2020-02-10 20:51:11,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:11,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:11,935 INFO L87 Difference]: Start difference. First operand 1578 states and 7078 transitions. Second operand 11 states. [2020-02-10 20:51:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:12,128 INFO L93 Difference]: Finished difference Result 2949 states and 11713 transitions. [2020-02-10 20:51:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:12,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:12,136 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 20:51:12,136 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:51:12,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:51:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1573. [2020-02-10 20:51:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7064 transitions. [2020-02-10 20:51:12,202 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7064 transitions. Word has length 28 [2020-02-10 20:51:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:12,203 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7064 transitions. [2020-02-10 20:51:12,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7064 transitions. [2020-02-10 20:51:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:12,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:12,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] [2020-02-10 20:51:12,205 INFO L427 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1929430334, now seen corresponding path program 771 times [2020-02-10 20:51:12,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:12,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247823047] [2020-02-10 20:51:12,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:12,555 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2020-02-10 20:51:12,780 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:51:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:12,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247823047] [2020-02-10 20:51:12,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:12,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:12,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477136441] [2020-02-10 20:51:12,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:12,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:12,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:12,788 INFO L87 Difference]: Start difference. First operand 1573 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:51:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:13,018 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 20:51:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:13,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:13,027 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:51:13,027 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:51:13,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:51:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1578. [2020-02-10 20:51:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:51:13,099 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:51:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:13,100 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:51:13,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:51:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:13,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:13,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] [2020-02-10 20:51:13,103 INFO L427 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash -131429468, now seen corresponding path program 772 times [2020-02-10 20:51:13,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:13,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286105592] [2020-02-10 20:51:13,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:13,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286105592] [2020-02-10 20:51:13,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:13,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:13,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244825433] [2020-02-10 20:51:13,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:13,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:13,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:13,618 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:51:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:13,814 INFO L93 Difference]: Finished difference Result 2953 states and 11716 transitions. [2020-02-10 20:51:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:13,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:13,822 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:51:13,822 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 20:51:13,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 20:51:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1573. [2020-02-10 20:51:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7059 transitions. [2020-02-10 20:51:13,889 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7059 transitions. Word has length 28 [2020-02-10 20:51:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:13,890 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7059 transitions. [2020-02-10 20:51:13,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7059 transitions. [2020-02-10 20:51:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:13,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:13,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] [2020-02-10 20:51:13,892 INFO L427 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -9893506, now seen corresponding path program 773 times [2020-02-10 20:51:13,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:13,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523401277] [2020-02-10 20:51:13,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:14,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523401277] [2020-02-10 20:51:14,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:14,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:14,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239711961] [2020-02-10 20:51:14,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:14,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:14,419 INFO L87 Difference]: Start difference. First operand 1573 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:51:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:14,617 INFO L93 Difference]: Finished difference Result 2953 states and 11717 transitions. [2020-02-10 20:51:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:14,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:14,626 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:51:14,626 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:51:14,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:51:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1579. [2020-02-10 20:51:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:51:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7070 transitions. [2020-02-10 20:51:14,693 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7070 transitions. Word has length 28 [2020-02-10 20:51:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:14,694 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7070 transitions. [2020-02-10 20:51:14,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7070 transitions. [2020-02-10 20:51:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:14,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:14,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:14,696 INFO L427 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:14,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1479511490, now seen corresponding path program 774 times [2020-02-10 20:51:14,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:14,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926734058] [2020-02-10 20:51:14,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:15,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926734058] [2020-02-10 20:51:15,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:15,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:15,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099396432] [2020-02-10 20:51:15,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:15,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:15,222 INFO L87 Difference]: Start difference. First operand 1579 states and 7070 transitions. Second operand 11 states. [2020-02-10 20:51:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:15,411 INFO L93 Difference]: Finished difference Result 2955 states and 11715 transitions. [2020-02-10 20:51:15,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:15,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:15,419 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:51:15,420 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 20:51:15,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 20:51:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1568. [2020-02-10 20:51:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:51:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7045 transitions. [2020-02-10 20:51:15,487 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7045 transitions. Word has length 28 [2020-02-10 20:51:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:15,487 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7045 transitions. [2020-02-10 20:51:15,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7045 transitions. [2020-02-10 20:51:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:15,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:15,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:15,490 INFO L427 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -704706260, now seen corresponding path program 775 times [2020-02-10 20:51:15,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:15,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008250069] [2020-02-10 20:51:15,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:16,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008250069] [2020-02-10 20:51:16,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:16,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:16,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002938423] [2020-02-10 20:51:16,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:16,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:16,034 INFO L87 Difference]: Start difference. First operand 1568 states and 7045 transitions. Second operand 11 states. [2020-02-10 20:51:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:16,214 INFO L93 Difference]: Finished difference Result 2947 states and 11709 transitions. [2020-02-10 20:51:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:16,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:16,222 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 20:51:16,222 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:51:16,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:51:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1578. [2020-02-10 20:51:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 20:51:16,290 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 20:51:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:16,291 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 20:51:16,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 20:51:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:16,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:16,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:16,293 INFO L427 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash 39996238, now seen corresponding path program 776 times [2020-02-10 20:51:16,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:16,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69058393] [2020-02-10 20:51:16,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:16,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69058393] [2020-02-10 20:51:16,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:16,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:16,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407394111] [2020-02-10 20:51:16,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:16,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:16,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:16,833 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:51:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:17,012 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 20:51:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:17,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:17,020 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:51:17,020 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:51:17,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:51:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1573. [2020-02-10 20:51:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7059 transitions. [2020-02-10 20:51:17,087 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7059 transitions. Word has length 28 [2020-02-10 20:51:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:17,087 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7059 transitions. [2020-02-10 20:51:17,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7059 transitions. [2020-02-10 20:51:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:17,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:17,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:17,089 INFO L427 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1981945854, now seen corresponding path program 777 times [2020-02-10 20:51:17,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:17,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757039098] [2020-02-10 20:51:17,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:17,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757039098] [2020-02-10 20:51:17,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:17,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663193233] [2020-02-10 20:51:17,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:17,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:17,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:17,659 INFO L87 Difference]: Start difference. First operand 1573 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:51:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:17,839 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 20:51:17,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:17,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:17,846 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 20:51:17,846 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 20:51:17,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 20:51:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1578. [2020-02-10 20:51:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:51:17,913 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:51:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:17,913 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:51:17,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:51:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:17,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:17,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] [2020-02-10 20:51:17,916 INFO L427 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -650368754, now seen corresponding path program 778 times [2020-02-10 20:51:17,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:17,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734577447] [2020-02-10 20:51:17,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:18,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734577447] [2020-02-10 20:51:18,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:18,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:18,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278344216] [2020-02-10 20:51:18,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:18,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:18,447 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:51:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:18,624 INFO L93 Difference]: Finished difference Result 2950 states and 11705 transitions. [2020-02-10 20:51:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:18,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:18,632 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 20:51:18,632 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 20:51:18,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 20:51:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1573. [2020-02-10 20:51:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7054 transitions. [2020-02-10 20:51:18,698 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7054 transitions. Word has length 28 [2020-02-10 20:51:18,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:18,698 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7054 transitions. [2020-02-10 20:51:18,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7054 transitions. [2020-02-10 20:51:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:18,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51: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] [2020-02-10 20:51:18,700 INFO L427 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 42622014, now seen corresponding path program 779 times [2020-02-10 20:51:18,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:18,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356014669] [2020-02-10 20:51:18,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:19,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356014669] [2020-02-10 20:51:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:19,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882585457] [2020-02-10 20:51:19,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:19,238 INFO L87 Difference]: Start difference. First operand 1573 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:51:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:19,444 INFO L93 Difference]: Finished difference Result 2951 states and 11708 transitions. [2020-02-10 20:51:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:19,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:19,452 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:51:19,452 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 20:51:19,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 20:51:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1579. [2020-02-10 20:51:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:51:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7065 transitions. [2020-02-10 20:51:19,519 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7065 transitions. Word has length 28 [2020-02-10 20:51:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:19,519 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7065 transitions. [2020-02-10 20:51:19,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7065 transitions. [2020-02-10 20:51:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:19,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:19,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] [2020-02-10 20:51:19,522 INFO L427 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:19,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash 960572204, now seen corresponding path program 780 times [2020-02-10 20:51:19,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:19,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792142765] [2020-02-10 20:51:19,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:20,055 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:51: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 20:51:20,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792142765] [2020-02-10 20:51:20,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:20,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:20,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415076066] [2020-02-10 20:51:20,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:20,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:20,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:20,064 INFO L87 Difference]: Start difference. First operand 1579 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:51:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:20,238 INFO L93 Difference]: Finished difference Result 2952 states and 11704 transitions. [2020-02-10 20:51:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:20,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:20,246 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:51:20,246 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:51:20,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:51:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1568. [2020-02-10 20:51:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:51:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7040 transitions. [2020-02-10 20:51:20,314 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7040 transitions. Word has length 28 [2020-02-10 20:51:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:20,315 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7040 transitions. [2020-02-10 20:51:20,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7040 transitions. [2020-02-10 20:51:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:20,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:20,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] [2020-02-10 20:51:20,317 INFO L427 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash -683700052, now seen corresponding path program 781 times [2020-02-10 20:51:20,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:20,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348958484] [2020-02-10 20:51:20,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:20,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348958484] [2020-02-10 20:51:20,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011239555] [2020-02-10 20:51:20,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:20,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:20,841 INFO L87 Difference]: Start difference. First operand 1568 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:51:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:21,022 INFO L93 Difference]: Finished difference Result 2952 states and 11715 transitions. [2020-02-10 20:51:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:21,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:21,030 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 20:51:21,030 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:51:21,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:51:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1578. [2020-02-10 20:51:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:51:21,098 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:51:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:21,098 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:51:21,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:51:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:21,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:21,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:21,100 INFO L427 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1550407442, now seen corresponding path program 782 times [2020-02-10 20:51:21,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:21,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287749946] [2020-02-10 20:51:21,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:21,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287749946] [2020-02-10 20:51:21,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:21,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:21,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135593420] [2020-02-10 20:51:21,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:21,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:21,625 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:51:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:21,798 INFO L93 Difference]: Finished difference Result 2955 states and 11716 transitions. [2020-02-10 20:51:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:21,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:21,806 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 20:51:21,806 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 20:51:21,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 20:51:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1573. [2020-02-10 20:51:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7054 transitions. [2020-02-10 20:51:21,912 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7054 transitions. Word has length 28 [2020-02-10 20:51:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:21,912 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7054 transitions. [2020-02-10 20:51:21,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7054 transitions. [2020-02-10 20:51:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:21,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:21,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:21,915 INFO L427 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1218929854, now seen corresponding path program 783 times [2020-02-10 20:51:21,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:21,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524507442] [2020-02-10 20:51:21,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51: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 20:51:22,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524507442] [2020-02-10 20:51:22,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:22,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:22,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411573580] [2020-02-10 20:51:22,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:22,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:22,438 INFO L87 Difference]: Start difference. First operand 1573 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:51:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:22,603 INFO L93 Difference]: Finished difference Result 2951 states and 11708 transitions. [2020-02-10 20:51:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:22,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:22,611 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 20:51:22,611 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:51:22,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:51:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 20:51:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7063 transitions. [2020-02-10 20:51:22,679 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7063 transitions. Word has length 28 [2020-02-10 20:51:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:22,680 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7063 transitions. [2020-02-10 20:51:22,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7063 transitions. [2020-02-10 20:51:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:22,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:22,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:22,682 INFO L427 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 443722834, now seen corresponding path program 784 times [2020-02-10 20:51:22,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:22,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104315364] [2020-02-10 20:51:22,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:23,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104315364] [2020-02-10 20:51:23,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:23,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:23,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44058250] [2020-02-10 20:51:23,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:23,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:23,212 INFO L87 Difference]: Start difference. First operand 1578 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:51:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:23,405 INFO L93 Difference]: Finished difference Result 2953 states and 11707 transitions. [2020-02-10 20:51:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:23,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:23,412 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 20:51:23,412 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 20:51:23,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 20:51:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1573. [2020-02-10 20:51:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 20:51:23,479 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 20:51:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:23,479 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 20:51:23,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 20:51:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:23,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:23,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] [2020-02-10 20:51:23,481 INFO L427 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1553033218, now seen corresponding path program 785 times [2020-02-10 20:51:23,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:23,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987826858] [2020-02-10 20:51:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:24,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987826858] [2020-02-10 20:51:24,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:24,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:24,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988603363] [2020-02-10 20:51:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:24,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:24,015 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:51:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:24,222 INFO L93 Difference]: Finished difference Result 2959 states and 11721 transitions. [2020-02-10 20:51:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:24,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:24,230 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:51:24,230 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 20:51:24,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 20:51:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1580. [2020-02-10 20:51:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 20:51:24,297 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 20:51:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:24,297 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 20:51:24,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 20:51:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:24,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:24,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] [2020-02-10 20:51:24,299 INFO L427 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 981578412, now seen corresponding path program 786 times [2020-02-10 20:51:24,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:24,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108700463] [2020-02-10 20:51:24,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:24,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108700463] [2020-02-10 20:51:24,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:24,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:24,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178439201] [2020-02-10 20:51:24,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:24,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:24,831 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 20:51:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:25,046 INFO L93 Difference]: Finished difference Result 2958 states and 11712 transitions. [2020-02-10 20:51:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:25,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:25,053 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:51:25,054 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 20:51:25,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 20:51:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1568. [2020-02-10 20:51:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:51:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7035 transitions. [2020-02-10 20:51:25,121 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7035 transitions. Word has length 28 [2020-02-10 20:51:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:25,122 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7035 transitions. [2020-02-10 20:51:25,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7035 transitions. [2020-02-10 20:51:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:25,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:25,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] [2020-02-10 20:51:25,124 INFO L427 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 71505550, now seen corresponding path program 787 times [2020-02-10 20:51:25,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:25,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354963380] [2020-02-10 20:51:25,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:25,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354963380] [2020-02-10 20:51:25,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:25,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:25,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965608438] [2020-02-10 20:51:25,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:25,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:25,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:25,663 INFO L87 Difference]: Start difference. First operand 1568 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:51:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:25,899 INFO L93 Difference]: Finished difference Result 2959 states and 11729 transitions. [2020-02-10 20:51:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:25,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:25,906 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:51:25,906 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 20:51:25,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 20:51:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1580. [2020-02-10 20:51:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7069 transitions. [2020-02-10 20:51:25,974 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7069 transitions. Word has length 28 [2020-02-10 20:51:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:25,974 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7069 transitions. [2020-02-10 20:51:25,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7069 transitions. [2020-02-10 20:51:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:25,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:25,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] [2020-02-10 20:51:25,977 INFO L427 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1560910546, now seen corresponding path program 788 times [2020-02-10 20:51:25,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:25,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798280593] [2020-02-10 20:51:25,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:26,509 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:26,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798280593] [2020-02-10 20:51:26,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:26,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:26,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500979826] [2020-02-10 20:51:26,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:26,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:26,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:26,517 INFO L87 Difference]: Start difference. First operand 1580 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:51:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:26,756 INFO L93 Difference]: Finished difference Result 2961 states and 11727 transitions. [2020-02-10 20:51:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:26,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:26,764 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 20:51:26,764 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 20:51:26,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 20:51:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1574. [2020-02-10 20:51:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:51:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7052 transitions. [2020-02-10 20:51:26,865 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7052 transitions. Word has length 28 [2020-02-10 20:51:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:26,865 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7052 transitions. [2020-02-10 20:51:26,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7052 transitions. [2020-02-10 20:51:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:26,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:26,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:26,867 INFO L427 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -463724252, now seen corresponding path program 789 times [2020-02-10 20:51:26,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:26,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548545493] [2020-02-10 20:51:26,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:27,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548545493] [2020-02-10 20:51:27,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:27,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:27,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720952017] [2020-02-10 20:51:27,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:27,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:27,402 INFO L87 Difference]: Start difference. First operand 1574 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:51:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:27,596 INFO L93 Difference]: Finished difference Result 2958 states and 11721 transitions. [2020-02-10 20:51:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:27,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:27,604 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 20:51:27,604 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 20:51:27,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 20:51:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1580. [2020-02-10 20:51:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7063 transitions. [2020-02-10 20:51:27,672 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7063 transitions. Word has length 28 [2020-02-10 20:51:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:27,672 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7063 transitions. [2020-02-10 20:51:27,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7063 transitions. [2020-02-10 20:51:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:27,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:27,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:27,675 INFO L427 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash 454225938, now seen corresponding path program 790 times [2020-02-10 20:51:27,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:27,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143913312] [2020-02-10 20:51:27,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:28,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143913312] [2020-02-10 20:51:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:28,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:28,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817680096] [2020-02-10 20:51:28,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:28,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:28,219 INFO L87 Difference]: Start difference. First operand 1580 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:51:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:28,438 INFO L93 Difference]: Finished difference Result 2959 states and 11717 transitions. [2020-02-10 20:51:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:28,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:28,445 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 20:51:28,446 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 20:51:28,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 20:51:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1574. [2020-02-10 20:51:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:51:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7046 transitions. [2020-02-10 20:51:28,512 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7046 transitions. Word has length 28 [2020-02-10 20:51:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:28,512 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7046 transitions. [2020-02-10 20:51:28,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7046 transitions. [2020-02-10 20:51:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:28,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:28,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] [2020-02-10 20:51:28,515 INFO L427 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash -47404636, now seen corresponding path program 791 times [2020-02-10 20:51:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413540296] [2020-02-10 20:51:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:29,043 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:51:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:29,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413540296] [2020-02-10 20:51:29,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:29,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:29,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233181780] [2020-02-10 20:51:29,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:29,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:29,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:29,051 INFO L87 Difference]: Start difference. First operand 1574 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:51:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:29,228 INFO L93 Difference]: Finished difference Result 2963 states and 11726 transitions. [2020-02-10 20:51:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:29,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:29,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:29,235 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 20:51:29,235 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 20:51:29,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 20:51:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1581. [2020-02-10 20:51:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7059 transitions. [2020-02-10 20:51:29,304 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7059 transitions. Word has length 28 [2020-02-10 20:51:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:29,304 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7059 transitions. [2020-02-10 20:51:29,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7059 transitions. [2020-02-10 20:51:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:29,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:29,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:29,307 INFO L427 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash -618859442, now seen corresponding path program 792 times [2020-02-10 20:51:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:29,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743148529] [2020-02-10 20:51:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:29,840 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:51:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:29,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743148529] [2020-02-10 20:51:29,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:29,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:29,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780680786] [2020-02-10 20:51:29,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:29,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:29,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:29,848 INFO L87 Difference]: Start difference. First operand 1581 states and 7059 transitions. Second operand 11 states. [2020-02-10 20:51:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:30,078 INFO L93 Difference]: Finished difference Result 2962 states and 11717 transitions. [2020-02-10 20:51:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:30,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:30,086 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 20:51:30,086 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 20:51:30,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 20:51:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1563. [2020-02-10 20:51:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:51:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7021 transitions. [2020-02-10 20:51:30,153 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7021 transitions. Word has length 28 [2020-02-10 20:51:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:30,153 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7021 transitions. [2020-02-10 20:51:30,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7021 transitions. [2020-02-10 20:51:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:30,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:30,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:30,156 INFO L427 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash 644085600, now seen corresponding path program 793 times [2020-02-10 20:51:30,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:30,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241660012] [2020-02-10 20:51:30,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:30,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241660012] [2020-02-10 20:51:30,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:30,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:30,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369156093] [2020-02-10 20:51:30,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:30,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:30,693 INFO L87 Difference]: Start difference. First operand 1563 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:51:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:30,874 INFO L93 Difference]: Finished difference Result 2985 states and 11793 transitions. [2020-02-10 20:51:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:30,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:30,882 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:51:30,882 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:51:30,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:51:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1584. [2020-02-10 20:51:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 20:51:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7089 transitions. [2020-02-10 20:51:30,950 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7089 transitions. Word has length 28 [2020-02-10 20:51:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:30,950 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7089 transitions. [2020-02-10 20:51:30,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7089 transitions. [2020-02-10 20:51:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:30,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:30,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:30,953 INFO L427 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2133490596, now seen corresponding path program 794 times [2020-02-10 20:51:30,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:30,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214738586] [2020-02-10 20:51:30,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:31,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214738586] [2020-02-10 20:51:31,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:31,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:31,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733303750] [2020-02-10 20:51:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:31,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:31,502 INFO L87 Difference]: Start difference. First operand 1584 states and 7089 transitions. Second operand 11 states. [2020-02-10 20:51:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:31,663 INFO L93 Difference]: Finished difference Result 2990 states and 11797 transitions. [2020-02-10 20:51:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:31,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:31,671 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:51:31,671 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 20:51:31,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 20:51:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1578. [2020-02-10 20:51:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 20:51:31,770 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 20:51:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:31,771 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 20:51:31,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 20:51:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:31,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:31,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:31,773 INFO L427 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:31,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2039940738, now seen corresponding path program 795 times [2020-02-10 20:51:31,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:31,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038863538] [2020-02-10 20:51:31,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:32,303 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:32,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038863538] [2020-02-10 20:51:32,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:32,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:32,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135033708] [2020-02-10 20:51:32,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:32,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:32,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:32,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:32,310 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:51:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:32,511 INFO L93 Difference]: Finished difference Result 2982 states and 11782 transitions. [2020-02-10 20:51:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:32,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:32,518 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 20:51:32,518 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:51:32,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:51:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1583. [2020-02-10 20:51:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:51:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7081 transitions. [2020-02-10 20:51:32,587 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7081 transitions. Word has length 28 [2020-02-10 20:51:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:32,587 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7081 transitions. [2020-02-10 20:51:32,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7081 transitions. [2020-02-10 20:51:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:32,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:32,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:32,590 INFO L427 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 194166756, now seen corresponding path program 796 times [2020-02-10 20:51:32,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:32,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560364929] [2020-02-10 20:51:32,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:33,134 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:33,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560364929] [2020-02-10 20:51:33,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:33,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:33,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051454401] [2020-02-10 20:51:33,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:33,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:33,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:33,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:33,141 INFO L87 Difference]: Start difference. First operand 1583 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:51:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:33,346 INFO L93 Difference]: Finished difference Result 2985 states and 11783 transitions. [2020-02-10 20:51:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:33,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:33,354 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 20:51:33,355 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:51:33,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:51:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1578. [2020-02-10 20:51:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:51:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 20:51:33,423 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 20:51:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:33,424 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 20:51:33,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 20:51:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:33,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:33,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] [2020-02-10 20:51:33,426 INFO L427 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1623621122, now seen corresponding path program 797 times [2020-02-10 20:51:33,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:33,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946730148] [2020-02-10 20:51:33,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:33,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946730148] [2020-02-10 20:51:33,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:33,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:33,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739021505] [2020-02-10 20:51:33,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:33,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:33,971 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:51:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:34,111 INFO L93 Difference]: Finished difference Result 2997 states and 11807 transitions. [2020-02-10 20:51:34,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:34,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:34,119 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:51:34,119 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:51:34,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:51:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1588. [2020-02-10 20:51:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:51:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7084 transitions. [2020-02-10 20:51:34,186 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7084 transitions. Word has length 28 [2020-02-10 20:51:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:34,187 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7084 transitions. [2020-02-10 20:51:34,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7084 transitions. [2020-02-10 20:51:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:34,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:34,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:34,189 INFO L427 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash -878918624, now seen corresponding path program 798 times [2020-02-10 20:51:34,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:34,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073644339] [2020-02-10 20:51:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:34,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 20:51:34,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073644339] [2020-02-10 20:51:34,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:34,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:34,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499991224] [2020-02-10 20:51:34,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:34,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:34,734 INFO L87 Difference]: Start difference. First operand 1588 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:51:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:34,937 INFO L93 Difference]: Finished difference Result 2995 states and 11795 transitions. [2020-02-10 20:51:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:34,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:34,945 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 20:51:34,945 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:51:34,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:51:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1571. [2020-02-10 20:51:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:51:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7047 transitions. [2020-02-10 20:51:35,011 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7047 transitions. Word has length 28 [2020-02-10 20:51:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:35,011 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7047 transitions. [2020-02-10 20:51:35,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7047 transitions. [2020-02-10 20:51:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:35,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:35,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] [2020-02-10 20:51:35,014 INFO L427 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1231830922, now seen corresponding path program 799 times [2020-02-10 20:51:35,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:35,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425854531] [2020-02-10 20:51:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:35,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425854531] [2020-02-10 20:51:35,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:35,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:35,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355131769] [2020-02-10 20:51:35,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:35,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:35,547 INFO L87 Difference]: Start difference. First operand 1571 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:51:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:35,731 INFO L93 Difference]: Finished difference Result 2981 states and 11778 transitions. [2020-02-10 20:51:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:35,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:35,739 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 20:51:35,739 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:51:35,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:51:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1583. [2020-02-10 20:51:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:51:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7080 transitions. [2020-02-10 20:51:35,806 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7080 transitions. Word has length 28 [2020-02-10 20:51:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:35,806 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7080 transitions. [2020-02-10 20:51:35,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7080 transitions. [2020-02-10 20:51:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:35,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:35,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:35,809 INFO L427 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1573731378, now seen corresponding path program 800 times [2020-02-10 20:51:35,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:35,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267473725] [2020-02-10 20:51:35,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:36,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267473725] [2020-02-10 20:51:36,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:36,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:36,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633367679] [2020-02-10 20:51:36,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:36,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:36,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:36,356 INFO L87 Difference]: Start difference. First operand 1583 states and 7080 transitions. Second operand 11 states. [2020-02-10 20:51:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:36,502 INFO L93 Difference]: Finished difference Result 2986 states and 11782 transitions. [2020-02-10 20:51:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:36,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:36,510 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 20:51:36,510 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 20:51:36,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 20:51:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1577. [2020-02-10 20:51:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:51:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 20:51:36,627 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 20:51:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:36,627 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 20:51:36,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 20:51:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:36,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:36,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:36,630 INFO L427 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1987425218, now seen corresponding path program 801 times [2020-02-10 20:51:36,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:36,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755725803] [2020-02-10 20:51:36,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:37,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755725803] [2020-02-10 20:51:37,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:37,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:37,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689245243] [2020-02-10 20:51:37,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:37,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:37,146 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:51:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:37,365 INFO L93 Difference]: Finished difference Result 2977 states and 11765 transitions. [2020-02-10 20:51:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:37,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:37,372 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 20:51:37,372 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:51:37,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:51:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1582. [2020-02-10 20:51:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:51:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7072 transitions. [2020-02-10 20:51:37,439 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7072 transitions. Word has length 28 [2020-02-10 20:51:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:37,439 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7072 transitions. [2020-02-10 20:51:37,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7072 transitions. [2020-02-10 20:51:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:37,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:37,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:37,441 INFO L427 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -324772530, now seen corresponding path program 802 times [2020-02-10 20:51:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317494673] [2020-02-10 20:51:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:37,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317494673] [2020-02-10 20:51:37,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:37,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:37,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858462714] [2020-02-10 20:51:37,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:37,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:37,954 INFO L87 Difference]: Start difference. First operand 1582 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:51:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:38,138 INFO L93 Difference]: Finished difference Result 2979 states and 11764 transitions. [2020-02-10 20:51:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:38,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:38,146 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:51:38,147 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:51:38,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:51:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1577. [2020-02-10 20:51:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:51:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7058 transitions. [2020-02-10 20:51:38,213 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7058 transitions. Word has length 28 [2020-02-10 20:51:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:38,213 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7058 transitions. [2020-02-10 20:51:38,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7058 transitions. [2020-02-10 20:51:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:38,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:38,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:38,216 INFO L427 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1571105602, now seen corresponding path program 803 times [2020-02-10 20:51:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:38,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146585889] [2020-02-10 20:51:38,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:38,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146585889] [2020-02-10 20:51:38,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:38,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:38,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449576097] [2020-02-10 20:51:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:38,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:38,753 INFO L87 Difference]: Start difference. First operand 1577 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:51:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:38,926 INFO L93 Difference]: Finished difference Result 2990 states and 11786 transitions. [2020-02-10 20:51:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:38,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:38,933 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 20:51:38,933 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 20:51:38,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 20:51:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1585. [2020-02-10 20:51:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:51:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 20:51:39,000 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 20:51:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:39,000 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 20:51:39,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 20:51:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:39,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:39,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:39,003 INFO L427 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:39,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1397857910, now seen corresponding path program 804 times [2020-02-10 20:51:39,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:39,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823853002] [2020-02-10 20:51:39,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:39,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823853002] [2020-02-10 20:51:39,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:39,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:39,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511177256] [2020-02-10 20:51:39,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:39,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:39,549 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:51:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:39,723 INFO L93 Difference]: Finished difference Result 2987 states and 11773 transitions. [2020-02-10 20:51:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:39,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:39,731 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 20:51:39,731 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 20:51:39,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 20:51:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1571. [2020-02-10 20:51:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:51:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7041 transitions. [2020-02-10 20:51:39,798 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7041 transitions. Word has length 28 [2020-02-10 20:51:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:39,798 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7041 transitions. [2020-02-10 20:51:39,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7041 transitions. [2020-02-10 20:51:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:39,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:39,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:39,801 INFO L427 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1242334026, now seen corresponding path program 805 times [2020-02-10 20:51:39,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:39,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742527169] [2020-02-10 20:51:39,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:40,322 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:40,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742527169] [2020-02-10 20:51:40,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:40,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:40,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475841032] [2020-02-10 20:51:40,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:40,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:40,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:40,331 INFO L87 Difference]: Start difference. First operand 1571 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:51:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:40,519 INFO L93 Difference]: Finished difference Result 2973 states and 11757 transitions. [2020-02-10 20:51:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:40,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:40,526 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 20:51:40,526 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 20:51:40,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 20:51:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 20:51:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7069 transitions. [2020-02-10 20:51:40,593 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7069 transitions. Word has length 28 [2020-02-10 20:51:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:40,593 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7069 transitions. [2020-02-10 20:51:40,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7069 transitions. [2020-02-10 20:51:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:40,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:40,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] [2020-02-10 20:51:40,595 INFO L427 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:40,596 INFO L82 PathProgramCache]: Analyzing trace with hash -818525776, now seen corresponding path program 806 times [2020-02-10 20:51:40,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:40,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576565237] [2020-02-10 20:51:40,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:41,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576565237] [2020-02-10 20:51:41,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:41,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:41,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737453141] [2020-02-10 20:51:41,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:41,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:41,139 INFO L87 Difference]: Start difference. First operand 1581 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:51:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:41,350 INFO L93 Difference]: Finished difference Result 2976 states and 11758 transitions. [2020-02-10 20:51:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:41,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:41,357 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 20:51:41,357 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 20:51:41,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 20:51:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1576. [2020-02-10 20:51:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:51:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7055 transitions. [2020-02-10 20:51:41,424 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7055 transitions. Word has length 28 [2020-02-10 20:51:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:41,424 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7055 transitions. [2020-02-10 20:51:41,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7055 transitions. [2020-02-10 20:51:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:41,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:41,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] [2020-02-10 20:51:41,427 INFO L427 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:41,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash 707104224, now seen corresponding path program 807 times [2020-02-10 20:51:41,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:41,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586079082] [2020-02-10 20:51:41,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:41,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586079082] [2020-02-10 20:51:41,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:41,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:41,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012657262] [2020-02-10 20:51:41,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:41,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:41,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:41,986 INFO L87 Difference]: Start difference. First operand 1576 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:51:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:42,185 INFO L93 Difference]: Finished difference Result 2972 states and 11750 transitions. [2020-02-10 20:51:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:42,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:42,193 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 20:51:42,193 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 20:51:42,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 20:51:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1581. [2020-02-10 20:51:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7064 transitions. [2020-02-10 20:51:42,259 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7064 transitions. Word has length 28 [2020-02-10 20:51:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:42,259 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7064 transitions. [2020-02-10 20:51:42,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7064 transitions. [2020-02-10 20:51:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:42,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:42,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] [2020-02-10 20:51:42,262 INFO L427 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1925210384, now seen corresponding path program 808 times [2020-02-10 20:51:42,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:42,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029549002] [2020-02-10 20:51:42,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:42,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029549002] [2020-02-10 20:51:42,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:42,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:42,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348346873] [2020-02-10 20:51:42,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:42,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:42,794 INFO L87 Difference]: Start difference. First operand 1581 states and 7064 transitions. Second operand 11 states. [2020-02-10 20:51:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:43,010 INFO L93 Difference]: Finished difference Result 2974 states and 11749 transitions. [2020-02-10 20:51:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:43,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:43,018 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 20:51:43,018 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:51:43,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:51:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1576. [2020-02-10 20:51:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:51:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7050 transitions. [2020-02-10 20:51:43,089 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7050 transitions. Word has length 28 [2020-02-10 20:51:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:43,089 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7050 transitions. [2020-02-10 20:51:43,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7050 transitions. [2020-02-10 20:51:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:43,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:43,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] [2020-02-10 20:51:43,092 INFO L427 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -815900000, now seen corresponding path program 809 times [2020-02-10 20:51:43,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:43,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613991928] [2020-02-10 20:51:43,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:43,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613991928] [2020-02-10 20:51:43,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:43,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:43,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81216265] [2020-02-10 20:51:43,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:43,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:43,625 INFO L87 Difference]: Start difference. First operand 1576 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:51:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:43,851 INFO L93 Difference]: Finished difference Result 2980 states and 11763 transitions. [2020-02-10 20:51:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:43,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:43,859 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 20:51:43,859 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:51:43,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:51:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1583. [2020-02-10 20:51:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:51:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7063 transitions. [2020-02-10 20:51:43,926 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7063 transitions. Word has length 28 [2020-02-10 20:51:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:43,926 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7063 transitions. [2020-02-10 20:51:43,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7063 transitions. [2020-02-10 20:51:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:43,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:43,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] [2020-02-10 20:51:43,929 INFO L427 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1387354806, now seen corresponding path program 810 times [2020-02-10 20:51:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126884126] [2020-02-10 20:51:43,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:44,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126884126] [2020-02-10 20:51:44,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:44,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:44,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783533956] [2020-02-10 20:51:44,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:44,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:44,465 INFO L87 Difference]: Start difference. First operand 1583 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:51:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:44,729 INFO L93 Difference]: Finished difference Result 2979 states and 11754 transitions. [2020-02-10 20:51:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:44,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:44,736 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 20:51:44,736 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 20:51:44,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 20:51:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1571. [2020-02-10 20:51:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:51:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 20:51:44,803 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 20:51:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:44,803 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 20:51:44,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 20:51:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:44,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:44,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:44,805 INFO L427 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1542222066, now seen corresponding path program 811 times [2020-02-10 20:51:44,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:44,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170464815] [2020-02-10 20:51:44,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:45,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170464815] [2020-02-10 20:51:45,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:45,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:45,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968942783] [2020-02-10 20:51:45,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:45,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:45,368 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 20:51:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:45,547 INFO L93 Difference]: Finished difference Result 3006 states and 11825 transitions. [2020-02-10 20:51:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:45,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:45,555 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:51:45,555 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 20:51:45,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 20:51:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1591. [2020-02-10 20:51:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:51:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7086 transitions. [2020-02-10 20:51:45,624 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7086 transitions. Word has length 28 [2020-02-10 20:51:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:45,624 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7086 transitions. [2020-02-10 20:51:45,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7086 transitions. [2020-02-10 20:51:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:45,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:45,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] [2020-02-10 20:51:45,627 INFO L427 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash -797519568, now seen corresponding path program 812 times [2020-02-10 20:51:45,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:45,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180585083] [2020-02-10 20:51:45,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:46,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180585083] [2020-02-10 20:51:46,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:46,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:46,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990461566] [2020-02-10 20:51:46,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:46,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:46,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:46,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:46,176 INFO L87 Difference]: Start difference. First operand 1591 states and 7086 transitions. Second operand 11 states. [2020-02-10 20:51:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:46,439 INFO L93 Difference]: Finished difference Result 3004 states and 11813 transitions. [2020-02-10 20:51:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:46,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:46,447 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 20:51:46,447 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:51:46,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:51:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1581. [2020-02-10 20:51:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7060 transitions. [2020-02-10 20:51:46,513 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7060 transitions. Word has length 28 [2020-02-10 20:51:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:46,514 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7060 transitions. [2020-02-10 20:51:46,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7060 transitions. [2020-02-10 20:51:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:46,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:46,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:46,516 INFO L427 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2077451868, now seen corresponding path program 813 times [2020-02-10 20:51:46,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:46,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610303763] [2020-02-10 20:51:46,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:46,878 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2020-02-10 20:51:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:47,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610303763] [2020-02-10 20:51:47,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:47,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:47,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857379406] [2020-02-10 20:51:47,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:47,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:47,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:47,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:47,103 INFO L87 Difference]: Start difference. First operand 1581 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:51:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:47,271 INFO L93 Difference]: Finished difference Result 3003 states and 11810 transitions. [2020-02-10 20:51:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:47,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:47,279 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:51:47,279 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:51:47,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:51:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1589. [2020-02-10 20:51:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 20:51:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7074 transitions. [2020-02-10 20:51:47,346 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7074 transitions. Word has length 28 [2020-02-10 20:51:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:47,346 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7074 transitions. [2020-02-10 20:51:47,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7074 transitions. [2020-02-10 20:51:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:47,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:47,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] [2020-02-10 20:51:47,348 INFO L427 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1904204176, now seen corresponding path program 814 times [2020-02-10 20:51:47,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:47,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744100620] [2020-02-10 20:51:47,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:47,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744100620] [2020-02-10 20:51:47,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:47,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:47,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721590197] [2020-02-10 20:51:47,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:47,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:47,893 INFO L87 Difference]: Start difference. First operand 1589 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:51:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:48,089 INFO L93 Difference]: Finished difference Result 3000 states and 11797 transitions. [2020-02-10 20:51:48,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:48,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:48,096 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:51:48,096 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:51:48,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:51:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1581. [2020-02-10 20:51:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7052 transitions. [2020-02-10 20:51:48,166 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7052 transitions. Word has length 28 [2020-02-10 20:51:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:48,166 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7052 transitions. [2020-02-10 20:51:48,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7052 transitions. [2020-02-10 20:51:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:48,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:48,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] [2020-02-10 20:51:48,169 INFO L427 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash 278191588, now seen corresponding path program 815 times [2020-02-10 20:51:48,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:48,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269943085] [2020-02-10 20:51:48,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:48,707 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:48,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269943085] [2020-02-10 20:51:48,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:48,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:48,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344352673] [2020-02-10 20:51:48,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:48,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:48,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:48,715 INFO L87 Difference]: Start difference. First operand 1581 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:51:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:48,913 INFO L93 Difference]: Finished difference Result 2998 states and 11794 transitions. [2020-02-10 20:51:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:48,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:48,920 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:51:48,920 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 20:51:48,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 20:51:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1588. [2020-02-10 20:51:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:51:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7065 transitions. [2020-02-10 20:51:48,988 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7065 transitions. Word has length 28 [2020-02-10 20:51:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:48,988 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7065 transitions. [2020-02-10 20:51:48,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7065 transitions. [2020-02-10 20:51:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:48,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:48,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:48,991 INFO L427 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash -293263218, now seen corresponding path program 816 times [2020-02-10 20:51:48,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:48,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039295786] [2020-02-10 20:51:48,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:49,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039295786] [2020-02-10 20:51:49,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:49,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:49,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699141283] [2020-02-10 20:51:49,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:49,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:49,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:49,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:49,527 INFO L87 Difference]: Start difference. First operand 1588 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:51:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:49,789 INFO L93 Difference]: Finished difference Result 2997 states and 11785 transitions. [2020-02-10 20:51:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:49,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:49,797 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:51:49,797 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 20:51:49,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 20:51:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1563. [2020-02-10 20:51:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:51:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7013 transitions. [2020-02-10 20:51:49,865 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7013 transitions. Word has length 28 [2020-02-10 20:51:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:49,865 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7013 transitions. [2020-02-10 20:51:49,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7013 transitions. [2020-02-10 20:51:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:49,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:49,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:49,868 INFO L427 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash -969642016, now seen corresponding path program 817 times [2020-02-10 20:51:49,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:49,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240677420] [2020-02-10 20:51:49,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:50,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240677420] [2020-02-10 20:51:50,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:50,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:50,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546574947] [2020-02-10 20:51:50,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:50,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:50,417 INFO L87 Difference]: Start difference. First operand 1563 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:51:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:50,589 INFO L93 Difference]: Finished difference Result 3001 states and 11833 transitions. [2020-02-10 20:51:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:50,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:50,596 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:51:50,596 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:51:50,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:51:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1588. [2020-02-10 20:51:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:51:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7093 transitions. [2020-02-10 20:51:50,663 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7093 transitions. Word has length 28 [2020-02-10 20:51:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:50,664 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7093 transitions. [2020-02-10 20:51:50,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7093 transitions. [2020-02-10 20:51:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:50,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:50,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:50,666 INFO L427 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash -224939518, now seen corresponding path program 818 times [2020-02-10 20:51:50,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:50,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286502898] [2020-02-10 20:51:50,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:51,221 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:51:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:51,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286502898] [2020-02-10 20:51:51,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:51,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:51,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100638711] [2020-02-10 20:51:51,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:51,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:51,228 INFO L87 Difference]: Start difference. First operand 1588 states and 7093 transitions. Second operand 11 states. [2020-02-10 20:51:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:51,373 INFO L93 Difference]: Finished difference Result 3005 states and 11834 transitions. [2020-02-10 20:51:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:51,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:51,381 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 20:51:51,382 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 20:51:51,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 20:51:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1581. [2020-02-10 20:51:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7073 transitions. [2020-02-10 20:51:51,448 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7073 transitions. Word has length 28 [2020-02-10 20:51:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:51,448 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7073 transitions. [2020-02-10 20:51:51,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7073 transitions. [2020-02-10 20:51:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:51,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:51,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] [2020-02-10 20:51:51,451 INFO L427 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash 641298942, now seen corresponding path program 819 times [2020-02-10 20:51:51,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:51,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805834044] [2020-02-10 20:51:51,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:51,989 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:51,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805834044] [2020-02-10 20:51:51,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:51,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:51,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510599683] [2020-02-10 20:51:51,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:51,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:51,997 INFO L87 Difference]: Start difference. First operand 1581 states and 7073 transitions. Second operand 11 states. [2020-02-10 20:51:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:52,201 INFO L93 Difference]: Finished difference Result 2998 states and 11821 transitions. [2020-02-10 20:51:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:52,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:52,209 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 20:51:52,209 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 20:51:52,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 20:51:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1587. [2020-02-10 20:51:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:51:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7084 transitions. [2020-02-10 20:51:52,276 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7084 transitions. Word has length 28 [2020-02-10 20:51:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:52,276 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7084 transitions. [2020-02-10 20:51:52,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7084 transitions. [2020-02-10 20:51:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:52,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:52,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:52,278 INFO L427 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2130703938, now seen corresponding path program 820 times [2020-02-10 20:51:52,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:52,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98616605] [2020-02-10 20:51:52,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:52,806 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:52,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98616605] [2020-02-10 20:51:52,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:52,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:52,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903380824] [2020-02-10 20:51:52,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:52,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:52,814 INFO L87 Difference]: Start difference. First operand 1587 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:51:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:53,005 INFO L93 Difference]: Finished difference Result 3000 states and 11819 transitions. [2020-02-10 20:51:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:53,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:53,013 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:51:53,013 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 20:51:53,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 20:51:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1581. [2020-02-10 20:51:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 20:51:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7067 transitions. [2020-02-10 20:51:53,080 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7067 transitions. Word has length 28 [2020-02-10 20:51:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:53,080 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7067 transitions. [2020-02-10 20:51:53,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7067 transitions. [2020-02-10 20:51:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:53,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:53,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:53,082 INFO L427 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1298024898, now seen corresponding path program 821 times [2020-02-10 20:51:53,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:53,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479999213] [2020-02-10 20:51:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:53,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479999213] [2020-02-10 20:51:53,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:53,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:53,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284364333] [2020-02-10 20:51:53,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:53,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:53,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:53,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:53,639 INFO L87 Difference]: Start difference. First operand 1581 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:51:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:53,769 INFO L93 Difference]: Finished difference Result 3010 states and 11838 transitions. [2020-02-10 20:51:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:53,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:53,777 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 20:51:53,778 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 20:51:53,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 20:51:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1591. [2020-02-10 20:51:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:51:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7084 transitions. [2020-02-10 20:51:53,845 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7084 transitions. Word has length 28 [2020-02-10 20:51:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:53,845 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7084 transitions. [2020-02-10 20:51:53,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7084 transitions. [2020-02-10 20:51:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:53,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:53,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] [2020-02-10 20:51:53,847 INFO L427 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:53,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash -553322400, now seen corresponding path program 822 times [2020-02-10 20:51:53,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:53,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757943095] [2020-02-10 20:51:53,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:54,434 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:51:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:54,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757943095] [2020-02-10 20:51:54,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:54,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:54,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856247715] [2020-02-10 20:51:54,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:54,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:54,442 INFO L87 Difference]: Start difference. First operand 1591 states and 7084 transitions. Second operand 11 states. [2020-02-10 20:51:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:54,613 INFO L93 Difference]: Finished difference Result 3008 states and 11826 transitions. [2020-02-10 20:51:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:54,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:54,621 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 20:51:54,621 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:51:54,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:51:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1573. [2020-02-10 20:51:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 20:51:54,686 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 20:51:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:54,687 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 20:51:54,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 20:51:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:54,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:54,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] [2020-02-10 20:51:54,689 INFO L427 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:54,689 INFO L82 PathProgramCache]: Analyzing trace with hash -381896694, now seen corresponding path program 823 times [2020-02-10 20:51:54,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:54,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867856576] [2020-02-10 20:51:54,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:55,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867856576] [2020-02-10 20:51:55,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:55,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:55,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800613153] [2020-02-10 20:51:55,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:55,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:55,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:55,225 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:51:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:55,401 INFO L93 Difference]: Finished difference Result 2997 states and 11817 transitions. [2020-02-10 20:51:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:55,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:55,408 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 20:51:55,409 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 20:51:55,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 20:51:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1587. [2020-02-10 20:51:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 20:51:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7083 transitions. [2020-02-10 20:51:55,475 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7083 transitions. Word has length 28 [2020-02-10 20:51:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:55,475 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7083 transitions. [2020-02-10 20:51:55,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7083 transitions. [2020-02-10 20:51:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:55,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:55,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:55,477 INFO L427 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash 362805804, now seen corresponding path program 824 times [2020-02-10 20:51:55,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:55,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566502069] [2020-02-10 20:51:55,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:56,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566502069] [2020-02-10 20:51:56,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:56,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:56,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387592747] [2020-02-10 20:51:56,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:56,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:56,025 INFO L87 Difference]: Start difference. First operand 1587 states and 7083 transitions. Second operand 11 states. [2020-02-10 20:51:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:56,163 INFO L93 Difference]: Finished difference Result 3001 states and 11818 transitions. [2020-02-10 20:51:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:56,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:56,171 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 20:51:56,171 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 20:51:56,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 20:51:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1580. [2020-02-10 20:51:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7063 transitions. [2020-02-10 20:51:56,238 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7063 transitions. Word has length 28 [2020-02-10 20:51:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:56,238 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7063 transitions. [2020-02-10 20:51:56,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7063 transitions. [2020-02-10 20:51:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:56,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:56,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:56,241 INFO L427 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash 693814462, now seen corresponding path program 825 times [2020-02-10 20:51:56,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:56,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341304806] [2020-02-10 20:51:56,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:56,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341304806] [2020-02-10 20:51:56,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:56,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:56,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234099346] [2020-02-10 20:51:56,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:56,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:56,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:56,785 INFO L87 Difference]: Start difference. First operand 1580 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:51:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:56,943 INFO L93 Difference]: Finished difference Result 2993 states and 11803 transitions. [2020-02-10 20:51:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:56,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:56,950 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:51:56,950 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 20:51:56,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 20:51:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1586. [2020-02-10 20:51:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:51:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7074 transitions. [2020-02-10 20:51:57,018 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7074 transitions. Word has length 28 [2020-02-10 20:51:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:57,018 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7074 transitions. [2020-02-10 20:51:57,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7074 transitions. [2020-02-10 20:51:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:57,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:57,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] [2020-02-10 20:51:57,020 INFO L427 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1611764652, now seen corresponding path program 826 times [2020-02-10 20:51:57,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:57,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560544691] [2020-02-10 20:51:57,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:57,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560544691] [2020-02-10 20:51:57,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:57,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:57,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666753733] [2020-02-10 20:51:57,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:57,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:57,607 INFO L87 Difference]: Start difference. First operand 1586 states and 7074 transitions. Second operand 11 states. [2020-02-10 20:51:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:57,774 INFO L93 Difference]: Finished difference Result 2994 states and 11799 transitions. [2020-02-10 20:51:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:57,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:57,782 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 20:51:57,782 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 20:51:57,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 20:51:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1580. [2020-02-10 20:51:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:51:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7057 transitions. [2020-02-10 20:51:57,847 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7057 transitions. Word has length 28 [2020-02-10 20:51:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:57,847 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7057 transitions. [2020-02-10 20:51:57,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7057 transitions. [2020-02-10 20:51:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:57,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:57,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:57,850 INFO L427 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1245509378, now seen corresponding path program 827 times [2020-02-10 20:51:57,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:57,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140443480] [2020-02-10 20:51:57,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:58,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140443480] [2020-02-10 20:51:58,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:58,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:58,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871717113] [2020-02-10 20:51:58,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:58,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:58,399 INFO L87 Difference]: Start difference. First operand 1580 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:51:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:58,553 INFO L93 Difference]: Finished difference Result 3003 states and 11816 transitions. [2020-02-10 20:51:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:58,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:58,561 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 20:51:58,561 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 20:51:58,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 20:51:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1588. [2020-02-10 20:51:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 20:51:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7071 transitions. [2020-02-10 20:51:58,627 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7071 transitions. Word has length 28 [2020-02-10 20:51:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:58,628 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7071 transitions. [2020-02-10 20:51:58,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7071 transitions. [2020-02-10 20:51:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:58,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:58,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:58,630 INFO L427 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1072261686, now seen corresponding path program 828 times [2020-02-10 20:51:58,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:58,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247046724] [2020-02-10 20:51:58,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:59,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247046724] [2020-02-10 20:51:59,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:59,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:59,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328600052] [2020-02-10 20:51:59,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:59,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:59,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:59,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:59,177 INFO L87 Difference]: Start difference. First operand 1588 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:51:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:59,382 INFO L93 Difference]: Finished difference Result 3000 states and 11803 transitions. [2020-02-10 20:51:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:51:59,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:51:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:59,389 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 20:51:59,389 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 20:51:59,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:51:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 20:51:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1573. [2020-02-10 20:51:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:51:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7037 transitions. [2020-02-10 20:51:59,456 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7037 transitions. Word has length 28 [2020-02-10 20:51:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:59,456 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7037 transitions. [2020-02-10 20:51:59,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:51:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7037 transitions. [2020-02-10 20:51:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:51:59,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:59,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] [2020-02-10 20:51:59,458 INFO L427 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:51:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash -371393590, now seen corresponding path program 829 times [2020-02-10 20:51:59,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:59,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886487778] [2020-02-10 20:51:59,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:59,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886487778] [2020-02-10 20:51:59,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:59,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:51:59,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975776072] [2020-02-10 20:51:59,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:51:59,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:51:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:59,999 INFO L87 Difference]: Start difference. First operand 1573 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:52:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:00,231 INFO L93 Difference]: Finished difference Result 2989 states and 11795 transitions. [2020-02-10 20:52:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:00,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:00,238 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:52:00,239 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 20:52:00,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 20:52:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1585. [2020-02-10 20:52:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:52:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7071 transitions. [2020-02-10 20:52:00,306 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7071 transitions. Word has length 28 [2020-02-10 20:52:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:00,306 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7071 transitions. [2020-02-10 20:52:00,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7071 transitions. [2020-02-10 20:52:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:00,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:00,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:00,309 INFO L427 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1118011406, now seen corresponding path program 830 times [2020-02-10 20:52:00,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:00,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199423230] [2020-02-10 20:52:00,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:00,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199423230] [2020-02-10 20:52:00,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:00,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:00,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448735302] [2020-02-10 20:52:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:00,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:00,852 INFO L87 Difference]: Start difference. First operand 1585 states and 7071 transitions. Second operand 11 states. [2020-02-10 20:52:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:01,041 INFO L93 Difference]: Finished difference Result 2991 states and 11793 transitions. [2020-02-10 20:52:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:01,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:01,049 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 20:52:01,049 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 20:52:01,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 20:52:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1579. [2020-02-10 20:52:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:52:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7054 transitions. [2020-02-10 20:52:01,116 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7054 transitions. Word has length 28 [2020-02-10 20:52:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:01,116 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7054 transitions. [2020-02-10 20:52:01,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7054 transitions. [2020-02-10 20:52:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:01,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:01,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:01,118 INFO L427 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash -906623392, now seen corresponding path program 831 times [2020-02-10 20:52:01,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:01,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941568758] [2020-02-10 20:52:01,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:01,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941568758] [2020-02-10 20:52:01,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:01,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:01,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994545911] [2020-02-10 20:52:01,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:01,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:01,658 INFO L87 Difference]: Start difference. First operand 1579 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:52:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:01,828 INFO L93 Difference]: Finished difference Result 2988 states and 11787 transitions. [2020-02-10 20:52:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:01,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:01,836 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 20:52:01,836 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 20:52:01,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 20:52:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1585. [2020-02-10 20:52:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 20:52:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7065 transitions. [2020-02-10 20:52:01,904 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7065 transitions. Word has length 28 [2020-02-10 20:52:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:01,904 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7065 transitions. [2020-02-10 20:52:01,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7065 transitions. [2020-02-10 20:52:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:01,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:01,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] [2020-02-10 20:52:01,906 INFO L427 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash 11326798, now seen corresponding path program 832 times [2020-02-10 20:52:01,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:01,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750235033] [2020-02-10 20:52:01,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:02,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750235033] [2020-02-10 20:52:02,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:02,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:02,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510070149] [2020-02-10 20:52:02,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:02,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:02,453 INFO L87 Difference]: Start difference. First operand 1585 states and 7065 transitions. Second operand 11 states. [2020-02-10 20:52:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:02,663 INFO L93 Difference]: Finished difference Result 2989 states and 11783 transitions. [2020-02-10 20:52:02,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:02,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:02,671 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 20:52:02,671 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 20:52:02,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 20:52:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1579. [2020-02-10 20:52:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:52:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7048 transitions. [2020-02-10 20:52:02,737 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7048 transitions. Word has length 28 [2020-02-10 20:52:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:02,737 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7048 transitions. [2020-02-10 20:52:02,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7048 transitions. [2020-02-10 20:52:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:02,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:02,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:02,740 INFO L427 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:02,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash -490303776, now seen corresponding path program 833 times [2020-02-10 20:52:02,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:02,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245021975] [2020-02-10 20:52:02,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:03,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245021975] [2020-02-10 20:52:03,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:03,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:03,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734900426] [2020-02-10 20:52:03,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:03,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:03,282 INFO L87 Difference]: Start difference. First operand 1579 states and 7048 transitions. Second operand 11 states. [2020-02-10 20:52:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:03,449 INFO L93 Difference]: Finished difference Result 2993 states and 11792 transitions. [2020-02-10 20:52:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:03,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:03,457 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 20:52:03,457 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 20:52:03,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 20:52:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1586. [2020-02-10 20:52:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 20:52:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7061 transitions. [2020-02-10 20:52:03,528 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7061 transitions. Word has length 28 [2020-02-10 20:52:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:03,528 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7061 transitions. [2020-02-10 20:52:03,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7061 transitions. [2020-02-10 20:52:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:03,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:03,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:03,531 INFO L427 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1061758582, now seen corresponding path program 834 times [2020-02-10 20:52:03,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:03,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468158243] [2020-02-10 20:52:03,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:04,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468158243] [2020-02-10 20:52:04,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:04,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:04,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2457022] [2020-02-10 20:52:04,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:04,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:04,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:04,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:04,082 INFO L87 Difference]: Start difference. First operand 1586 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:52:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:04,257 INFO L93 Difference]: Finished difference Result 2992 states and 11783 transitions. [2020-02-10 20:52:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:04,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:04,265 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 20:52:04,265 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 20:52:04,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 20:52:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1573. [2020-02-10 20:52:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:52:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7031 transitions. [2020-02-10 20:52:04,334 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7031 transitions. Word has length 28 [2020-02-10 20:52:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:04,334 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7031 transitions. [2020-02-10 20:52:04,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7031 transitions. [2020-02-10 20:52:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:04,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:04,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:04,337 INFO L427 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 383812012, now seen corresponding path program 835 times [2020-02-10 20:52:04,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:04,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244597298] [2020-02-10 20:52:04,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:04,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244597298] [2020-02-10 20:52:04,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:04,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:04,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310194197] [2020-02-10 20:52:04,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:04,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:04,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:04,899 INFO L87 Difference]: Start difference. First operand 1573 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:52:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:05,070 INFO L93 Difference]: Finished difference Result 3015 states and 11843 transitions. [2020-02-10 20:52:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:05,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:05,077 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 20:52:05,077 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 20:52:05,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 20:52:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1593. [2020-02-10 20:52:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 20:52:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7081 transitions. [2020-02-10 20:52:05,146 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7081 transitions. Word has length 28 [2020-02-10 20:52:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:05,146 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7081 transitions. [2020-02-10 20:52:05,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7081 transitions. [2020-02-10 20:52:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:05,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:05,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:05,148 INFO L427 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1128514510, now seen corresponding path program 836 times [2020-02-10 20:52:05,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:05,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835650796] [2020-02-10 20:52:05,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:05,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835650796] [2020-02-10 20:52:05,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:05,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:05,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126632689] [2020-02-10 20:52:05,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:05,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:05,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:05,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:05,699 INFO L87 Difference]: Start difference. First operand 1593 states and 7081 transitions. Second operand 11 states. [2020-02-10 20:52:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:05,867 INFO L93 Difference]: Finished difference Result 3013 states and 11831 transitions. [2020-02-10 20:52:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:05,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:05,876 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 20:52:05,876 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 20:52:05,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 20:52:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 20:52:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:52:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7055 transitions. [2020-02-10 20:52:05,944 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7055 transitions. Word has length 28 [2020-02-10 20:52:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:05,944 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7055 transitions. [2020-02-10 20:52:05,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7055 transitions. [2020-02-10 20:52:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:05,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:05,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:05,947 INFO L427 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash -151417790, now seen corresponding path program 837 times [2020-02-10 20:52:05,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:05,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743651633] [2020-02-10 20:52:05,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:06,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743651633] [2020-02-10 20:52:06,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:06,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:06,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309824638] [2020-02-10 20:52:06,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:06,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:06,499 INFO L87 Difference]: Start difference. First operand 1583 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:52:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:06,634 INFO L93 Difference]: Finished difference Result 3012 states and 11828 transitions. [2020-02-10 20:52:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:06,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:06,641 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 20:52:06,641 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 20:52:06,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 20:52:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1591. [2020-02-10 20:52:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 20:52:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7069 transitions. [2020-02-10 20:52:06,708 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7069 transitions. Word has length 28 [2020-02-10 20:52:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:06,708 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7069 transitions. [2020-02-10 20:52:06,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7069 transitions. [2020-02-10 20:52:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:06,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:06,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] [2020-02-10 20:52:06,711 INFO L427 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 21829902, now seen corresponding path program 838 times [2020-02-10 20:52:06,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:06,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007874737] [2020-02-10 20:52:06,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:07,251 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:07,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007874737] [2020-02-10 20:52:07,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:07,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:07,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93237972] [2020-02-10 20:52:07,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:07,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:07,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:07,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:07,259 INFO L87 Difference]: Start difference. First operand 1591 states and 7069 transitions. Second operand 11 states. [2020-02-10 20:52:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:07,433 INFO L93 Difference]: Finished difference Result 3009 states and 11815 transitions. [2020-02-10 20:52:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:07,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:07,441 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 20:52:07,442 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 20:52:07,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 20:52:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1583. [2020-02-10 20:52:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:52:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7047 transitions. [2020-02-10 20:52:07,508 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7047 transitions. Word has length 28 [2020-02-10 20:52:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:07,508 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7047 transitions. [2020-02-10 20:52:07,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7047 transitions. [2020-02-10 20:52:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:07,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:07,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:07,511 INFO L427 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2090741630, now seen corresponding path program 839 times [2020-02-10 20:52:07,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:07,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501698687] [2020-02-10 20:52:07,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:07,901 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 20:52:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:08,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501698687] [2020-02-10 20:52:08,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:08,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:08,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950985711] [2020-02-10 20:52:08,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:08,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:08,133 INFO L87 Difference]: Start difference. First operand 1583 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:52:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:08,333 INFO L93 Difference]: Finished difference Result 3007 states and 11812 transitions. [2020-02-10 20:52:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:08,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:08,341 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 20:52:08,341 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 20:52:08,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 20:52:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1590. [2020-02-10 20:52:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 20:52:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7060 transitions. [2020-02-10 20:52:08,409 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7060 transitions. Word has length 28 [2020-02-10 20:52:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:08,409 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7060 transitions. [2020-02-10 20:52:08,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7060 transitions. [2020-02-10 20:52:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:08,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:08,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] [2020-02-10 20:52:08,412 INFO L427 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1632770860, now seen corresponding path program 840 times [2020-02-10 20:52:08,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:08,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019134809] [2020-02-10 20:52:08,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:08,956 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 20:52:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:08,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019134809] [2020-02-10 20:52:08,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:08,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:08,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250210285] [2020-02-10 20:52:08,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:08,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:08,965 INFO L87 Difference]: Start difference. First operand 1590 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:52:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:09,148 INFO L93 Difference]: Finished difference Result 3006 states and 11803 transitions. [2020-02-10 20:52:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:09,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:09,156 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 20:52:09,156 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 20:52:09,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 20:52:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1553. [2020-02-10 20:52:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2020-02-10 20:52:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 6987 transitions. [2020-02-10 20:52:09,224 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 6987 transitions. Word has length 28 [2020-02-10 20:52:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:09,224 INFO L479 AbstractCegarLoop]: Abstraction has 1553 states and 6987 transitions. [2020-02-10 20:52:09,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 6987 transitions. [2020-02-10 20:52:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:09,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:09,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:09,227 INFO L427 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash -471497986, now seen corresponding path program 841 times [2020-02-10 20:52:09,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:09,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212522914] [2020-02-10 20:52:09,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:09,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212522914] [2020-02-10 20:52:09,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:09,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:09,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412771174] [2020-02-10 20:52:09,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:09,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:09,754 INFO L87 Difference]: Start difference. First operand 1553 states and 6987 transitions. Second operand 11 states. [2020-02-10 20:52:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:09,936 INFO L93 Difference]: Finished difference Result 2917 states and 11586 transitions. [2020-02-10 20:52:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:09,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:09,943 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:52:09,944 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 20:52:09,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 20:52:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1576. [2020-02-10 20:52:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:52:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7075 transitions. [2020-02-10 20:52:10,010 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7075 transitions. Word has length 28 [2020-02-10 20:52:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:10,010 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7075 transitions. [2020-02-10 20:52:10,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7075 transitions. [2020-02-10 20:52:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:10,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:10,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] [2020-02-10 20:52:10,013 INFO L427 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash 273204512, now seen corresponding path program 842 times [2020-02-10 20:52:10,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:10,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165751826] [2020-02-10 20:52:10,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:10,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165751826] [2020-02-10 20:52:10,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:10,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:10,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006264272] [2020-02-10 20:52:10,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:10,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:10,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:10,548 INFO L87 Difference]: Start difference. First operand 1576 states and 7075 transitions. Second operand 11 states. [2020-02-10 20:52:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:10,731 INFO L93 Difference]: Finished difference Result 2918 states and 11583 transitions. [2020-02-10 20:52:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:10,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:10,738 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:52:10,739 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:52:10,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:52:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1571. [2020-02-10 20:52:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:52:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7061 transitions. [2020-02-10 20:52:10,806 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7061 transitions. Word has length 28 [2020-02-10 20:52:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:10,806 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7061 transitions. [2020-02-10 20:52:10,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7061 transitions. [2020-02-10 20:52:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:10,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:10,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:10,809 INFO L427 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1139442972, now seen corresponding path program 843 times [2020-02-10 20:52:10,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:10,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216269426] [2020-02-10 20:52:10,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:11,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216269426] [2020-02-10 20:52:11,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:11,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:11,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475236713] [2020-02-10 20:52:11,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:11,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:11,344 INFO L87 Difference]: Start difference. First operand 1571 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:52:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:11,545 INFO L93 Difference]: Finished difference Result 2922 states and 11590 transitions. [2020-02-10 20:52:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:11,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:11,553 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 20:52:11,553 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:52:11,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:52:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1577. [2020-02-10 20:52:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:52:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 20:52:11,619 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 20:52:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:11,620 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 20:52:11,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 20:52:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:11,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:11,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:11,622 INFO L427 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1666119328, now seen corresponding path program 844 times [2020-02-10 20:52:11,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:11,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596367386] [2020-02-10 20:52:11,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:12,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596367386] [2020-02-10 20:52:12,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:12,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:12,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940997824] [2020-02-10 20:52:12,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:12,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:12,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:12,165 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 20:52:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:12,314 INFO L93 Difference]: Finished difference Result 2927 states and 11594 transitions. [2020-02-10 20:52:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:12,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:12,322 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 20:52:12,322 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:52:12,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:52:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1571. [2020-02-10 20:52:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:52:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7055 transitions. [2020-02-10 20:52:12,389 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7055 transitions. Word has length 28 [2020-02-10 20:52:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:12,389 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7055 transitions. [2020-02-10 20:52:12,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7055 transitions. [2020-02-10 20:52:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:12,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:12,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] [2020-02-10 20:52:12,392 INFO L427 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash -799880868, now seen corresponding path program 845 times [2020-02-10 20:52:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266859797] [2020-02-10 20:52:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:12,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266859797] [2020-02-10 20:52:12,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:12,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:12,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628880330] [2020-02-10 20:52:12,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:12,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:12,934 INFO L87 Difference]: Start difference. First operand 1571 states and 7055 transitions. Second operand 11 states. [2020-02-10 20:52:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:13,110 INFO L93 Difference]: Finished difference Result 2925 states and 11591 transitions. [2020-02-10 20:52:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:13,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:13,117 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:52:13,117 INFO L226 Difference]: Without dead ends: 2909 [2020-02-10 20:52:13,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2020-02-10 20:52:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1578. [2020-02-10 20:52:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:52:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:52:13,185 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:52:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:13,185 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:52:13,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:52:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:13,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:13,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:13,188 INFO L427 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -55178370, now seen corresponding path program 846 times [2020-02-10 20:52:13,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:13,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772558590] [2020-02-10 20:52:13,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:13,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772558590] [2020-02-10 20:52:13,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:13,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:13,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365689201] [2020-02-10 20:52:13,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:13,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:13,775 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:52:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:13,925 INFO L93 Difference]: Finished difference Result 2929 states and 11592 transitions. [2020-02-10 20:52:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:13,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:13,933 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 20:52:13,933 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 20:52:13,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 20:52:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1565. [2020-02-10 20:52:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:52:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7038 transitions. [2020-02-10 20:52:13,998 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7038 transitions. Word has length 28 [2020-02-10 20:52:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:13,999 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7038 transitions. [2020-02-10 20:52:13,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7038 transitions. [2020-02-10 20:52:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:14,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:14,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:14,001 INFO L427 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:14,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 248514488, now seen corresponding path program 847 times [2020-02-10 20:52:14,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:14,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584730464] [2020-02-10 20:52:14,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:14,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 20:52:14,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584730464] [2020-02-10 20:52:14,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:14,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:14,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689017227] [2020-02-10 20:52:14,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:14,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:14,519 INFO L87 Difference]: Start difference. First operand 1565 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:52:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:14,705 INFO L93 Difference]: Finished difference Result 2912 states and 11570 transitions. [2020-02-10 20:52:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:14,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:14,713 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 20:52:14,713 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 20:52:14,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 20:52:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1575. [2020-02-10 20:52:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:52:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 20:52:14,779 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 20:52:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:14,780 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 20:52:14,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 20:52:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:14,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:14,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] [2020-02-10 20:52:14,782 INFO L427 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash 993216986, now seen corresponding path program 848 times [2020-02-10 20:52:14,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:14,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796879256] [2020-02-10 20:52:14,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:15,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796879256] [2020-02-10 20:52:15,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:15,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:15,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416097844] [2020-02-10 20:52:15,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:15,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:15,307 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 20:52:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:15,525 INFO L93 Difference]: Finished difference Result 2913 states and 11567 transitions. [2020-02-10 20:52:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:15,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:15,532 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:52:15,532 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 20:52:15,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 20:52:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1570. [2020-02-10 20:52:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:52:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 20:52:15,598 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 20:52:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:15,598 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 20:52:15,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 20:52:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:15,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:15,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:15,601 INFO L427 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -824570892, now seen corresponding path program 849 times [2020-02-10 20:52:15,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:15,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468186577] [2020-02-10 20:52:15,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:16,115 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:16,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468186577] [2020-02-10 20:52:16,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:16,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:16,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196648931] [2020-02-10 20:52:16,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:16,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:16,122 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:52:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:16,381 INFO L93 Difference]: Finished difference Result 2914 states and 11569 transitions. [2020-02-10 20:52:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:16,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:16,389 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 20:52:16,389 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:52:16,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:52:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1575. [2020-02-10 20:52:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:52:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 20:52:16,457 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 20:52:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:16,457 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 20:52:16,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 20:52:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:16,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:16,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:16,459 INFO L427 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1409536602, now seen corresponding path program 850 times [2020-02-10 20:52:16,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:16,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842868936] [2020-02-10 20:52:16,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:16,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842868936] [2020-02-10 20:52:16,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:16,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:16,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201583884] [2020-02-10 20:52:16,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:16,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:16,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:16,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:16,986 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 20:52:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:17,186 INFO L93 Difference]: Finished difference Result 2917 states and 11570 transitions. [2020-02-10 20:52:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:17,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:17,193 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:52:17,193 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 20:52:17,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 20:52:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1570. [2020-02-10 20:52:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:52:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 20:52:17,261 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 20:52:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:17,261 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 20:52:17,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 20:52:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:17,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:17,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:17,263 INFO L427 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1531072564, now seen corresponding path program 851 times [2020-02-10 20:52:17,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:17,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029912912] [2020-02-10 20:52:17,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:17,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029912912] [2020-02-10 20:52:17,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:17,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:17,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919897828] [2020-02-10 20:52:17,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:17,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:17,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:17,786 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:52:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:17,999 INFO L93 Difference]: Finished difference Result 2917 states and 11571 transitions. [2020-02-10 20:52:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:18,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:18,008 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 20:52:18,008 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 20:52:18,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 20:52:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1576. [2020-02-10 20:52:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:52:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7058 transitions. [2020-02-10 20:52:18,075 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7058 transitions. Word has length 28 [2020-02-10 20:52:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:18,075 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7058 transitions. [2020-02-10 20:52:18,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7058 transitions. [2020-02-10 20:52:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:18,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:18,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:18,077 INFO L427 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1274489736, now seen corresponding path program 852 times [2020-02-10 20:52:18,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:18,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348335797] [2020-02-10 20:52:18,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:18,587 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:52:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:18,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348335797] [2020-02-10 20:52:18,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:18,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:18,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526547890] [2020-02-10 20:52:18,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:18,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:18,595 INFO L87 Difference]: Start difference. First operand 1576 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:52:18,817 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-02-10 20:52:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:18,837 INFO L93 Difference]: Finished difference Result 2919 states and 11569 transitions. [2020-02-10 20:52:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:18,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:18,845 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 20:52:18,845 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:52:18,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:52:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1565. [2020-02-10 20:52:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:52:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7033 transitions. [2020-02-10 20:52:18,914 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7033 transitions. Word has length 28 [2020-02-10 20:52:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:18,915 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7033 transitions. [2020-02-10 20:52:18,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7033 transitions. [2020-02-10 20:52:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:18,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:18,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] [2020-02-10 20:52:18,917 INFO L427 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash 259017592, now seen corresponding path program 853 times [2020-02-10 20:52:18,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:18,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513700582] [2020-02-10 20:52:18,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:19,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513700582] [2020-02-10 20:52:19,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:19,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:19,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60784842] [2020-02-10 20:52:19,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:19,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:19,443 INFO L87 Difference]: Start difference. First operand 1565 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:52:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:19,650 INFO L93 Difference]: Finished difference Result 2928 states and 11597 transitions. [2020-02-10 20:52:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:19,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:19,658 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:52:19,658 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 20:52:19,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 20:52:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1578. [2020-02-10 20:52:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 20:52:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 20:52:19,727 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 20:52:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:19,727 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 20:52:19,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 20:52:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:19,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:19,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:19,730 INFO L427 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1748422588, now seen corresponding path program 854 times [2020-02-10 20:52:19,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:19,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366919361] [2020-02-10 20:52:19,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:20,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366919361] [2020-02-10 20:52:20,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:20,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:20,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417540910] [2020-02-10 20:52:20,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:20,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:20,252 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 20:52:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:20,412 INFO L93 Difference]: Finished difference Result 2933 states and 11601 transitions. [2020-02-10 20:52:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:20,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:20,420 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 20:52:20,420 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 20:52:20,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 20:52:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1572. [2020-02-10 20:52:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:52:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7051 transitions. [2020-02-10 20:52:20,486 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7051 transitions. Word has length 28 [2020-02-10 20:52:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:20,486 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7051 transitions. [2020-02-10 20:52:20,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7051 transitions. [2020-02-10 20:52:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:20,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:20,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:20,489 INFO L427 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1869958550, now seen corresponding path program 855 times [2020-02-10 20:52:20,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:20,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503582354] [2020-02-10 20:52:20,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:21,002 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:21,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503582354] [2020-02-10 20:52:21,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:21,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:21,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328823508] [2020-02-10 20:52:21,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:21,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:21,009 INFO L87 Difference]: Start difference. First operand 1572 states and 7051 transitions. Second operand 11 states. [2020-02-10 20:52:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:21,237 INFO L93 Difference]: Finished difference Result 2925 states and 11586 transitions. [2020-02-10 20:52:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:21,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:21,244 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 20:52:21,244 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:52:21,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:52:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1577. [2020-02-10 20:52:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 20:52:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7060 transitions. [2020-02-10 20:52:21,310 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7060 transitions. Word has length 28 [2020-02-10 20:52:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:21,310 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7060 transitions. [2020-02-10 20:52:21,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7060 transitions. [2020-02-10 20:52:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:21,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:21,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:21,312 INFO L427 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:21,312 INFO L82 PathProgramCache]: Analyzing trace with hash -190901252, now seen corresponding path program 856 times [2020-02-10 20:52:21,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:21,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818426597] [2020-02-10 20:52:21,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:21,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818426597] [2020-02-10 20:52:21,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:21,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:21,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639766559] [2020-02-10 20:52:21,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:21,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:21,828 INFO L87 Difference]: Start difference. First operand 1577 states and 7060 transitions. Second operand 11 states. [2020-02-10 20:52:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:22,021 INFO L93 Difference]: Finished difference Result 2928 states and 11587 transitions. [2020-02-10 20:52:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:22,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:22,029 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 20:52:22,029 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 20:52:22,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 20:52:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1572. [2020-02-10 20:52:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:52:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 20:52:22,097 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 20:52:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:22,097 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 20:52:22,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 20:52:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:22,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:22,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:22,100 INFO L427 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2008689130, now seen corresponding path program 857 times [2020-02-10 20:52:22,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:22,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263603601] [2020-02-10 20:52:22,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:22,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263603601] [2020-02-10 20:52:22,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:22,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:22,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022280520] [2020-02-10 20:52:22,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:22,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:22,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:22,645 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:52:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:22,859 INFO L93 Difference]: Finished difference Result 2940 states and 11611 transitions. [2020-02-10 20:52:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:22,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:22,866 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 20:52:22,867 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 20:52:22,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 20:52:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1582. [2020-02-10 20:52:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 20:52:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7063 transitions. [2020-02-10 20:52:22,933 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7063 transitions. Word has length 28 [2020-02-10 20:52:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:22,933 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7063 transitions. [2020-02-10 20:52:22,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7063 transitions. [2020-02-10 20:52:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:22,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:22,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:22,936 INFO L427 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1263986632, now seen corresponding path program 858 times [2020-02-10 20:52:22,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:22,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231993205] [2020-02-10 20:52:22,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:23,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231993205] [2020-02-10 20:52:23,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:23,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:23,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796518321] [2020-02-10 20:52:23,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:23,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:23,471 INFO L87 Difference]: Start difference. First operand 1582 states and 7063 transitions. Second operand 11 states. [2020-02-10 20:52:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:23,678 INFO L93 Difference]: Finished difference Result 2938 states and 11599 transitions. [2020-02-10 20:52:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:23,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:23,686 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 20:52:23,686 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 20:52:23,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 20:52:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1565. [2020-02-10 20:52:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:52:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7026 transitions. [2020-02-10 20:52:23,753 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7026 transitions. Word has length 28 [2020-02-10 20:52:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:23,754 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7026 transitions. [2020-02-10 20:52:23,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7026 transitions. [2020-02-10 20:52:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:23,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:23,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] [2020-02-10 20:52:23,756 INFO L427 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1014223194, now seen corresponding path program 859 times [2020-02-10 20:52:23,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:23,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584972645] [2020-02-10 20:52:23,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:24,310 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:24,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584972645] [2020-02-10 20:52:24,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:24,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:24,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730691585] [2020-02-10 20:52:24,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:24,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:24,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:24,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:24,318 INFO L87 Difference]: Start difference. First operand 1565 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:52:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:24,523 INFO L93 Difference]: Finished difference Result 2935 states and 11609 transitions. [2020-02-10 20:52:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:24,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:24,531 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 20:52:24,531 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 20:52:24,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 20:52:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1580. [2020-02-10 20:52:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:52:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7067 transitions. [2020-02-10 20:52:24,598 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7067 transitions. Word has length 28 [2020-02-10 20:52:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:24,598 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7067 transitions. [2020-02-10 20:52:24,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7067 transitions. [2020-02-10 20:52:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:24,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:24,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:24,600 INFO L427 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1758925692, now seen corresponding path program 860 times [2020-02-10 20:52:24,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:24,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64382253] [2020-02-10 20:52:24,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:25,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64382253] [2020-02-10 20:52:25,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:25,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:25,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595345267] [2020-02-10 20:52:25,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:25,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:25,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:25,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:25,133 INFO L87 Difference]: Start difference. First operand 1580 states and 7067 transitions. Second operand 11 states. [2020-02-10 20:52:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:25,278 INFO L93 Difference]: Finished difference Result 2939 states and 11610 transitions. [2020-02-10 20:52:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:25,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:25,286 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 20:52:25,286 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 20:52:25,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 20:52:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1573. [2020-02-10 20:52:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:52:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7047 transitions. [2020-02-10 20:52:25,353 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7047 transitions. Word has length 28 [2020-02-10 20:52:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:25,353 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7047 transitions. [2020-02-10 20:52:25,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7047 transitions. [2020-02-10 20:52:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:25,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:25,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] [2020-02-10 20:52:25,355 INFO L427 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1669803144, now seen corresponding path program 861 times [2020-02-10 20:52:25,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:25,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657469660] [2020-02-10 20:52:25,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:25,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657469660] [2020-02-10 20:52:25,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:25,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:25,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740900145] [2020-02-10 20:52:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:25,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:25,885 INFO L87 Difference]: Start difference. First operand 1573 states and 7047 transitions. Second operand 11 states. [2020-02-10 20:52:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:26,087 INFO L93 Difference]: Finished difference Result 2932 states and 11597 transitions. [2020-02-10 20:52:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:26,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:26,095 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 20:52:26,095 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 20:52:26,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 20:52:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1579. [2020-02-10 20:52:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 20:52:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7058 transitions. [2020-02-10 20:52:26,161 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7058 transitions. Word has length 28 [2020-02-10 20:52:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:26,161 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7058 transitions. [2020-02-10 20:52:26,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7058 transitions. [2020-02-10 20:52:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:26,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:26,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] [2020-02-10 20:52:26,164 INFO L427 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash -180398148, now seen corresponding path program 862 times [2020-02-10 20:52:26,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:26,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714634474] [2020-02-10 20:52:26,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:26,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714634474] [2020-02-10 20:52:26,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:26,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:26,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260806484] [2020-02-10 20:52:26,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:26,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:26,689 INFO L87 Difference]: Start difference. First operand 1579 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:52:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:26,878 INFO L93 Difference]: Finished difference Result 2934 states and 11595 transitions. [2020-02-10 20:52:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:26,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:26,885 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 20:52:26,885 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 20:52:26,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 20:52:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1573. [2020-02-10 20:52:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:52:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 20:52:26,951 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 20:52:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:26,951 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 20:52:26,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 20:52:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:26,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:26,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:26,954 INFO L427 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:26,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash 685840312, now seen corresponding path program 863 times [2020-02-10 20:52:26,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:26,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579790615] [2020-02-10 20:52:26,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:27,380 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2020-02-10 20:52:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:27,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579790615] [2020-02-10 20:52:27,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:27,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:27,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463424865] [2020-02-10 20:52:27,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:27,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:27,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:27,497 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:52:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:27,638 INFO L93 Difference]: Finished difference Result 2944 states and 11614 transitions. [2020-02-10 20:52:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:27,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:27,646 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 20:52:27,646 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 20:52:27,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 20:52:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1583. [2020-02-10 20:52:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 20:52:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7058 transitions. [2020-02-10 20:52:27,712 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7058 transitions. Word has length 28 [2020-02-10 20:52:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:27,713 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7058 transitions. [2020-02-10 20:52:27,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7058 transitions. [2020-02-10 20:52:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:27,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:27,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] [2020-02-10 20:52:27,715 INFO L427 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1430542810, now seen corresponding path program 864 times [2020-02-10 20:52:27,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:27,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916846632] [2020-02-10 20:52:27,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:28,246 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:52:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:28,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916846632] [2020-02-10 20:52:28,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:28,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:28,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955527600] [2020-02-10 20:52:28,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:28,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:28,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:28,253 INFO L87 Difference]: Start difference. First operand 1583 states and 7058 transitions. Second operand 11 states. [2020-02-10 20:52:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:28,472 INFO L93 Difference]: Finished difference Result 2942 states and 11602 transitions. [2020-02-10 20:52:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:28,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:28,480 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 20:52:28,480 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 20:52:28,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 20:52:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1558. [2020-02-10 20:52:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:52:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7008 transitions. [2020-02-10 20:52:28,546 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7008 transitions. Word has length 28 [2020-02-10 20:52:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:28,546 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7008 transitions. [2020-02-10 20:52:28,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7008 transitions. [2020-02-10 20:52:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:28,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:28,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:28,548 INFO L427 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash -556215610, now seen corresponding path program 865 times [2020-02-10 20:52:28,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:28,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661280411] [2020-02-10 20:52:28,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52: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 20:52:29,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661280411] [2020-02-10 20:52:29,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:29,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:29,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594745390] [2020-02-10 20:52:29,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:29,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:29,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:29,074 INFO L87 Difference]: Start difference. First operand 1558 states and 7008 transitions. Second operand 11 states. [2020-02-10 20:52:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:29,246 INFO L93 Difference]: Finished difference Result 2889 states and 11495 transitions. [2020-02-10 20:52:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:29,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:29,254 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 20:52:29,254 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 20:52:29,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 20:52:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1573. [2020-02-10 20:52:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:52:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 20:52:29,320 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 20:52:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:29,320 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 20:52:29,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 20:52:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:29,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:29,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:29,322 INFO L427 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 188486888, now seen corresponding path program 866 times [2020-02-10 20:52:29,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:29,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332286250] [2020-02-10 20:52:29,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:29,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332286250] [2020-02-10 20:52:29,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:29,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:29,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854396053] [2020-02-10 20:52:29,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:29,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:29,874 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:52:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:30,050 INFO L93 Difference]: Finished difference Result 2890 states and 11492 transitions. [2020-02-10 20:52:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:30,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:30,058 INFO L225 Difference]: With dead ends: 2890 [2020-02-10 20:52:30,058 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 20:52:30,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 20:52:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1568. [2020-02-10 20:52:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:52:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 20:52:30,124 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 20:52:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:30,124 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 20:52:30,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 20:52:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:30,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:30,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:30,126 INFO L427 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1054725348, now seen corresponding path program 867 times [2020-02-10 20:52:30,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:30,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200687280] [2020-02-10 20:52:30,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:30,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200687280] [2020-02-10 20:52:30,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:30,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:30,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841724932] [2020-02-10 20:52:30,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:30,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:30,638 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 20:52:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:30,828 INFO L93 Difference]: Finished difference Result 2894 states and 11499 transitions. [2020-02-10 20:52:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:30,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:30,835 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 20:52:30,835 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 20:52:30,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 20:52:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1574. [2020-02-10 20:52:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 20:52:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 20:52:30,902 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 20:52:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:30,902 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 20:52:30,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 20:52:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:30,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:30,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:30,904 INFO L427 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1750836952, now seen corresponding path program 868 times [2020-02-10 20:52:30,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:30,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203618164] [2020-02-10 20:52:30,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:31,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203618164] [2020-02-10 20:52:31,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:31,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:31,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279181640] [2020-02-10 20:52:31,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:31,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:31,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:31,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:31,425 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 20:52:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:31,568 INFO L93 Difference]: Finished difference Result 2899 states and 11503 transitions. [2020-02-10 20:52:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:31,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:31,575 INFO L225 Difference]: With dead ends: 2899 [2020-02-10 20:52:31,576 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:52:31,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:52:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1568. [2020-02-10 20:52:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:52:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7037 transitions. [2020-02-10 20:52:31,642 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7037 transitions. Word has length 28 [2020-02-10 20:52:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:31,642 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7037 transitions. [2020-02-10 20:52:31,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7037 transitions. [2020-02-10 20:52:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:31,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:31,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:31,644 INFO L427 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash -884598492, now seen corresponding path program 869 times [2020-02-10 20:52:31,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:31,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940880564] [2020-02-10 20:52:31,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:32,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940880564] [2020-02-10 20:52:32,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:32,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:32,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177040867] [2020-02-10 20:52:32,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:32,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:32,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:32,172 INFO L87 Difference]: Start difference. First operand 1568 states and 7037 transitions. Second operand 11 states. [2020-02-10 20:52:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:32,349 INFO L93 Difference]: Finished difference Result 2897 states and 11500 transitions. [2020-02-10 20:52:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:32,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:32,357 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:52:32,358 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 20:52:32,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 20:52:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1575. [2020-02-10 20:52:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:52:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 20:52:32,423 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 20:52:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:32,423 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 20:52:32,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 20:52:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:32,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:32,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] [2020-02-10 20:52:32,426 INFO L427 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash -139895994, now seen corresponding path program 870 times [2020-02-10 20:52:32,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:32,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288375422] [2020-02-10 20:52:32,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:32,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288375422] [2020-02-10 20:52:32,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:32,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:32,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686574445] [2020-02-10 20:52:32,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:32,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:32,966 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 20:52:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:33,137 INFO L93 Difference]: Finished difference Result 2901 states and 11501 transitions. [2020-02-10 20:52:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:33,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:33,145 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 20:52:33,145 INFO L226 Difference]: Without dead ends: 2868 [2020-02-10 20:52:33,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2020-02-10 20:52:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 1562. [2020-02-10 20:52:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:52:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7022 transitions. [2020-02-10 20:52:33,210 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7022 transitions. Word has length 28 [2020-02-10 20:52:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:33,211 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7022 transitions. [2020-02-10 20:52:33,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7022 transitions. [2020-02-10 20:52:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:33,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:33,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:33,213 INFO L427 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1913959506, now seen corresponding path program 871 times [2020-02-10 20:52:33,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:33,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582671442] [2020-02-10 20:52:33,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:33,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582671442] [2020-02-10 20:52:33,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:33,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:33,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21284399] [2020-02-10 20:52:33,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:33,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:33,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:33,729 INFO L87 Difference]: Start difference. First operand 1562 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:52:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:33,905 INFO L93 Difference]: Finished difference Result 2872 states and 11448 transitions. [2020-02-10 20:52:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:33,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:33,913 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 20:52:33,913 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 20:52:33,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 20:52:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1570. [2020-02-10 20:52:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:52:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7042 transitions. [2020-02-10 20:52:33,979 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7042 transitions. Word has length 28 [2020-02-10 20:52:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:33,979 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7042 transitions. [2020-02-10 20:52:33,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7042 transitions. [2020-02-10 20:52:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:33,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:33,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:33,981 INFO L427 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:33,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1636305292, now seen corresponding path program 872 times [2020-02-10 20:52:33,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:33,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014016065] [2020-02-10 20:52:33,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:34,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014016065] [2020-02-10 20:52:34,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:34,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:34,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537174811] [2020-02-10 20:52:34,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:34,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:34,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:34,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:34,489 INFO L87 Difference]: Start difference. First operand 1570 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:52:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:34,713 INFO L93 Difference]: Finished difference Result 2873 states and 11445 transitions. [2020-02-10 20:52:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:34,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:34,721 INFO L225 Difference]: With dead ends: 2873 [2020-02-10 20:52:34,721 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 20:52:34,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 20:52:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1565. [2020-02-10 20:52:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:52:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7030 transitions. [2020-02-10 20:52:34,787 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7030 transitions. Word has length 28 [2020-02-10 20:52:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:34,788 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7030 transitions. [2020-02-10 20:52:34,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7030 transitions. [2020-02-10 20:52:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:34,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:34,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] [2020-02-10 20:52:34,790 INFO L427 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1202891370, now seen corresponding path program 873 times [2020-02-10 20:52:34,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:34,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835958920] [2020-02-10 20:52:34,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:35,331 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 20:52:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:35,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835958920] [2020-02-10 20:52:35,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:35,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:35,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527558515] [2020-02-10 20:52:35,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:35,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:35,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:35,338 INFO L87 Difference]: Start difference. First operand 1565 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:52:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:35,568 INFO L93 Difference]: Finished difference Result 2867 states and 11433 transitions. [2020-02-10 20:52:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:35,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:35,576 INFO L225 Difference]: With dead ends: 2867 [2020-02-10 20:52:35,576 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 20:52:35,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 20:52:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1568. [2020-02-10 20:52:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:52:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7035 transitions. [2020-02-10 20:52:35,641 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7035 transitions. Word has length 28 [2020-02-10 20:52:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:35,642 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7035 transitions. [2020-02-10 20:52:35,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7035 transitions. [2020-02-10 20:52:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:35,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:35,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:35,644 INFO L427 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1744945170, now seen corresponding path program 874 times [2020-02-10 20:52:35,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:35,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265873018] [2020-02-10 20:52:35,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:36,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265873018] [2020-02-10 20:52:36,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:36,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:36,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748798744] [2020-02-10 20:52:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:36,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:36,156 INFO L87 Difference]: Start difference. First operand 1568 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:52:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:36,387 INFO L93 Difference]: Finished difference Result 2865 states and 11426 transitions. [2020-02-10 20:52:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:36,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:36,395 INFO L225 Difference]: With dead ends: 2865 [2020-02-10 20:52:36,395 INFO L226 Difference]: Without dead ends: 2849 [2020-02-10 20:52:36,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2020-02-10 20:52:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 1565. [2020-02-10 20:52:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 20:52:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7027 transitions. [2020-02-10 20:52:36,462 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7027 transitions. Word has length 28 [2020-02-10 20:52:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:36,462 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7027 transitions. [2020-02-10 20:52:36,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7027 transitions. [2020-02-10 20:52:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:36,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:36,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:36,465 INFO L427 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:36,465 INFO L82 PathProgramCache]: Analyzing trace with hash -447685768, now seen corresponding path program 875 times [2020-02-10 20:52:36,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:36,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233947429] [2020-02-10 20:52:36,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:36,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233947429] [2020-02-10 20:52:36,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:36,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:36,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7856642] [2020-02-10 20:52:36,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:36,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:36,971 INFO L87 Difference]: Start difference. First operand 1565 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:52:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:37,159 INFO L93 Difference]: Finished difference Result 2869 states and 11434 transitions. [2020-02-10 20:52:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:37,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:37,167 INFO L225 Difference]: With dead ends: 2869 [2020-02-10 20:52:37,168 INFO L226 Difference]: Without dead ends: 2853 [2020-02-10 20:52:37,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2020-02-10 20:52:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1568. [2020-02-10 20:52:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 20:52:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7032 transitions. [2020-02-10 20:52:37,236 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7032 transitions. Word has length 28 [2020-02-10 20:52:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:37,236 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7032 transitions. [2020-02-10 20:52:37,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7032 transitions. [2020-02-10 20:52:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:37,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:37,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:37,238 INFO L427 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:37,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:37,238 INFO L82 PathProgramCache]: Analyzing trace with hash 144507316, now seen corresponding path program 876 times [2020-02-10 20:52:37,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:37,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852434798] [2020-02-10 20:52:37,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52: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 20:52:37,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852434798] [2020-02-10 20:52:37,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:37,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:37,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589630226] [2020-02-10 20:52:37,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:37,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:37,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:37,740 INFO L87 Difference]: Start difference. First operand 1568 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:52:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:37,955 INFO L93 Difference]: Finished difference Result 2866 states and 11425 transitions. [2020-02-10 20:52:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:37,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:37,963 INFO L225 Difference]: With dead ends: 2866 [2020-02-10 20:52:37,963 INFO L226 Difference]: Without dead ends: 2847 [2020-02-10 20:52:37,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2020-02-10 20:52:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1562. [2020-02-10 20:52:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:52:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7019 transitions. [2020-02-10 20:52:38,028 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7019 transitions. Word has length 28 [2020-02-10 20:52:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:38,029 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7019 transitions. [2020-02-10 20:52:38,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7019 transitions. [2020-02-10 20:52:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:38,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:38,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:38,031 INFO L427 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash -444470608, now seen corresponding path program 877 times [2020-02-10 20:52:38,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:38,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929518843] [2020-02-10 20:52:38,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:38,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929518843] [2020-02-10 20:52:38,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:38,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:38,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066773187] [2020-02-10 20:52:38,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:38,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:38,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:38,538 INFO L87 Difference]: Start difference. First operand 1562 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:52:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:38,778 INFO L93 Difference]: Finished difference Result 2884 states and 11468 transitions. [2020-02-10 20:52:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:38,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:38,786 INFO L225 Difference]: With dead ends: 2884 [2020-02-10 20:52:38,786 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 20:52:38,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 20:52:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1572. [2020-02-10 20:52:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:52:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7044 transitions. [2020-02-10 20:52:38,854 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7044 transitions. Word has length 28 [2020-02-10 20:52:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:38,854 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7044 transitions. [2020-02-10 20:52:38,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7044 transitions. [2020-02-10 20:52:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:38,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:38,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] [2020-02-10 20:52:38,857 INFO L427 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1044934388, now seen corresponding path program 878 times [2020-02-10 20:52:38,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:38,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751857935] [2020-02-10 20:52:38,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:39,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751857935] [2020-02-10 20:52:39,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:39,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:39,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259851515] [2020-02-10 20:52:39,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:39,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:39,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:39,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:39,362 INFO L87 Difference]: Start difference. First operand 1572 states and 7044 transitions. Second operand 11 states. [2020-02-10 20:52:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:39,509 INFO L93 Difference]: Finished difference Result 2889 states and 11472 transitions. [2020-02-10 20:52:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:39,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:39,515 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 20:52:39,515 INFO L226 Difference]: Without dead ends: 2863 [2020-02-10 20:52:39,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2020-02-10 20:52:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 1566. [2020-02-10 20:52:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:52:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7029 transitions. [2020-02-10 20:52:39,581 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7029 transitions. Word has length 28 [2020-02-10 20:52:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:39,581 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7029 transitions. [2020-02-10 20:52:39,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7029 transitions. [2020-02-10 20:52:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:39,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:39,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:39,584 INFO L427 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash 723142708, now seen corresponding path program 879 times [2020-02-10 20:52:39,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:39,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824212920] [2020-02-10 20:52:39,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:40,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824212920] [2020-02-10 20:52:40,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:40,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:40,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403329952] [2020-02-10 20:52:40,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:40,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:40,097 INFO L87 Difference]: Start difference. First operand 1566 states and 7029 transitions. Second operand 11 states. [2020-02-10 20:52:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:40,288 INFO L93 Difference]: Finished difference Result 2874 states and 11443 transitions. [2020-02-10 20:52:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:40,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:40,296 INFO L225 Difference]: With dead ends: 2874 [2020-02-10 20:52:40,296 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:52:40,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:52:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1569. [2020-02-10 20:52:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:52:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7034 transitions. [2020-02-10 20:52:40,364 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7034 transitions. Word has length 28 [2020-02-10 20:52:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:40,365 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7034 transitions. [2020-02-10 20:52:40,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7034 transitions. [2020-02-10 20:52:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:40,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:40,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] [2020-02-10 20:52:40,367 INFO L427 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash -623988048, now seen corresponding path program 880 times [2020-02-10 20:52:40,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:40,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715342686] [2020-02-10 20:52:40,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:40,882 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 20:52:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:40,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715342686] [2020-02-10 20:52:40,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:40,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:40,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34604180] [2020-02-10 20:52:40,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:40,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:40,890 INFO L87 Difference]: Start difference. First operand 1569 states and 7034 transitions. Second operand 11 states. [2020-02-10 20:52:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:41,137 INFO L93 Difference]: Finished difference Result 2872 states and 11436 transitions. [2020-02-10 20:52:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:41,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:41,144 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 20:52:41,144 INFO L226 Difference]: Without dead ends: 2856 [2020-02-10 20:52:41,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-02-10 20:52:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1566. [2020-02-10 20:52:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:52:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7026 transitions. [2020-02-10 20:52:41,210 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7026 transitions. Word has length 28 [2020-02-10 20:52:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:41,210 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7026 transitions. [2020-02-10 20:52:41,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7026 transitions. [2020-02-10 20:52:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:41,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:41,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:41,212 INFO L427 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2061413384, now seen corresponding path program 881 times [2020-02-10 20:52:41,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:41,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121675231] [2020-02-10 20:52:41,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:41,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121675231] [2020-02-10 20:52:41,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:41,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:41,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078702400] [2020-02-10 20:52:41,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:41,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:41,712 INFO L87 Difference]: Start difference. First operand 1566 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:52:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:41,902 INFO L93 Difference]: Finished difference Result 2885 states and 11460 transitions. [2020-02-10 20:52:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:41,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:41,910 INFO L225 Difference]: With dead ends: 2885 [2020-02-10 20:52:41,910 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 20:52:41,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 20:52:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1570. [2020-02-10 20:52:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:52:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 20:52:41,979 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 20:52:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:41,979 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 20:52:41,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 20:52:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:41,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:41,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:41,982 INFO L427 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash 470103540, now seen corresponding path program 882 times [2020-02-10 20:52:41,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:41,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219101986] [2020-02-10 20:52:41,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:42,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219101986] [2020-02-10 20:52:42,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:42,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:42,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796598404] [2020-02-10 20:52:42,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:42,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:42,465 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:52:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:42,657 INFO L93 Difference]: Finished difference Result 2878 states and 11443 transitions. [2020-02-10 20:52:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:42,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:42,665 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 20:52:42,665 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 20:52:42,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 20:52:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1562. [2020-02-10 20:52:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 20:52:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7015 transitions. [2020-02-10 20:52:42,730 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7015 transitions. Word has length 28 [2020-02-10 20:52:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:42,731 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7015 transitions. [2020-02-10 20:52:42,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7015 transitions. [2020-02-10 20:52:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:42,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:42,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:42,733 INFO L427 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:42,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2058198224, now seen corresponding path program 883 times [2020-02-10 20:52:42,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:42,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352682460] [2020-02-10 20:52:42,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:43,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352682460] [2020-02-10 20:52:43,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:43,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:43,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169093423] [2020-02-10 20:52:43,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:43,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:43,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:43,251 INFO L87 Difference]: Start difference. First operand 1562 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:52:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:43,427 INFO L93 Difference]: Finished difference Result 2889 states and 11476 transitions. [2020-02-10 20:52:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:43,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:43,434 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 20:52:43,435 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:52:43,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:52:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1573. [2020-02-10 20:52:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:52:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7042 transitions. [2020-02-10 20:52:43,500 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7042 transitions. Word has length 28 [2020-02-10 20:52:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:43,501 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7042 transitions. [2020-02-10 20:52:43,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7042 transitions. [2020-02-10 20:52:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:43,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:43,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] [2020-02-10 20:52:43,503 INFO L427 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1313495726, now seen corresponding path program 884 times [2020-02-10 20:52:43,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:43,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052728779] [2020-02-10 20:52:43,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:44,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052728779] [2020-02-10 20:52:44,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:44,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:44,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687443690] [2020-02-10 20:52:44,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:44,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:44,037 INFO L87 Difference]: Start difference. First operand 1573 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:52:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:44,176 INFO L93 Difference]: Finished difference Result 2893 states and 11477 transitions. [2020-02-10 20:52:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:44,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:44,183 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:52:44,183 INFO L226 Difference]: Without dead ends: 2866 [2020-02-10 20:52:44,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2020-02-10 20:52:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 1566. [2020-02-10 20:52:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:52:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7025 transitions. [2020-02-10 20:52:44,249 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7025 transitions. Word has length 28 [2020-02-10 20:52:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:44,249 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7025 transitions. [2020-02-10 20:52:44,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7025 transitions. [2020-02-10 20:52:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:44,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:44,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:44,251 INFO L427 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash -890584908, now seen corresponding path program 885 times [2020-02-10 20:52:44,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:44,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797326948] [2020-02-10 20:52:44,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:44,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797326948] [2020-02-10 20:52:44,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:44,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:44,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128159911] [2020-02-10 20:52:44,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:44,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:44,766 INFO L87 Difference]: Start difference. First operand 1566 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:52:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:44,973 INFO L93 Difference]: Finished difference Result 2878 states and 11448 transitions. [2020-02-10 20:52:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:44,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:44,981 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 20:52:44,981 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 20:52:44,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 20:52:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1569. [2020-02-10 20:52:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:52:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7030 transitions. [2020-02-10 20:52:45,049 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7030 transitions. Word has length 28 [2020-02-10 20:52:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:45,049 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7030 transitions. [2020-02-10 20:52:45,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7030 transitions. [2020-02-10 20:52:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:45,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:45,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:45,052 INFO L427 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:45,052 INFO L82 PathProgramCache]: Analyzing trace with hash -298391824, now seen corresponding path program 886 times [2020-02-10 20:52:45,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:45,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517099447] [2020-02-10 20:52:45,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:45,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517099447] [2020-02-10 20:52:45,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:45,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:45,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754799910] [2020-02-10 20:52:45,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:45,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:45,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:45,588 INFO L87 Difference]: Start difference. First operand 1569 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:52:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:45,809 INFO L93 Difference]: Finished difference Result 2875 states and 11439 transitions. [2020-02-10 20:52:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:45,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:45,817 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 20:52:45,817 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:52:45,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:52:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1566. [2020-02-10 20:52:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:52:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7022 transitions. [2020-02-10 20:52:45,883 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7022 transitions. Word has length 28 [2020-02-10 20:52:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:45,883 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7022 transitions. [2020-02-10 20:52:45,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7022 transitions. [2020-02-10 20:52:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:45,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:45,885 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:45,885 INFO L427 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash -135379306, now seen corresponding path program 887 times [2020-02-10 20:52:45,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:45,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435261812] [2020-02-10 20:52:45,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:46,445 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:46,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435261812] [2020-02-10 20:52:46,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:46,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:46,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492321780] [2020-02-10 20:52:46,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:46,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:46,453 INFO L87 Difference]: Start difference. First operand 1566 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:52:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:46,649 INFO L93 Difference]: Finished difference Result 2887 states and 11461 transitions. [2020-02-10 20:52:46,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:46,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:46,657 INFO L225 Difference]: With dead ends: 2887 [2020-02-10 20:52:46,658 INFO L226 Difference]: Without dead ends: 2867 [2020-02-10 20:52:46,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-02-10 20:52:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1570. [2020-02-10 20:52:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:52:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 20:52:46,728 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 20:52:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:46,728 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 20:52:46,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 20:52:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:46,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:46,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:46,732 INFO L427 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1898829678, now seen corresponding path program 888 times [2020-02-10 20:52:46,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:46,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088746324] [2020-02-10 20:52:46,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:47,252 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:47,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088746324] [2020-02-10 20:52:47,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:47,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:47,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110168841] [2020-02-10 20:52:47,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:47,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:47,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:47,259 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:52:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:47,459 INFO L93 Difference]: Finished difference Result 2880 states and 11444 transitions. [2020-02-10 20:52:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:47,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:47,467 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:52:47,467 INFO L226 Difference]: Without dead ends: 2855 [2020-02-10 20:52:47,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2020-02-10 20:52:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1558. [2020-02-10 20:52:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:52:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7004 transitions. [2020-02-10 20:52:47,533 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7004 transitions. Word has length 28 [2020-02-10 20:52:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:47,533 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7004 transitions. [2020-02-10 20:52:47,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7004 transitions. [2020-02-10 20:52:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:47,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:47,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:47,535 INFO L427 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash 236053416, now seen corresponding path program 889 times [2020-02-10 20:52:47,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:47,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935658271] [2020-02-10 20:52:47,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:48,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935658271] [2020-02-10 20:52:48,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:48,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:48,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471820696] [2020-02-10 20:52:48,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:48,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:48,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:48,055 INFO L87 Difference]: Start difference. First operand 1558 states and 7004 transitions. Second operand 11 states. [2020-02-10 20:52:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:48,289 INFO L93 Difference]: Finished difference Result 2875 states and 11459 transitions. [2020-02-10 20:52:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:48,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:48,297 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 20:52:48,297 INFO L226 Difference]: Without dead ends: 2860 [2020-02-10 20:52:48,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-02-10 20:52:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 1571. [2020-02-10 20:52:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:52:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7046 transitions. [2020-02-10 20:52:48,363 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7046 transitions. Word has length 28 [2020-02-10 20:52:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:48,363 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7046 transitions. [2020-02-10 20:52:48,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7046 transitions. [2020-02-10 20:52:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:48,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:48,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:48,366 INFO L427 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 980755914, now seen corresponding path program 890 times [2020-02-10 20:52:48,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:48,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697215404] [2020-02-10 20:52:48,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:48,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697215404] [2020-02-10 20:52:48,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:48,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:48,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928828537] [2020-02-10 20:52:48,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:48,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:48,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:48,873 INFO L87 Difference]: Start difference. First operand 1571 states and 7046 transitions. Second operand 11 states. [2020-02-10 20:52:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:49,095 INFO L93 Difference]: Finished difference Result 2876 states and 11456 transitions. [2020-02-10 20:52:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:49,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:49,103 INFO L225 Difference]: With dead ends: 2876 [2020-02-10 20:52:49,103 INFO L226 Difference]: Without dead ends: 2855 [2020-02-10 20:52:49,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2020-02-10 20:52:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1566. [2020-02-10 20:52:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:52:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7032 transitions. [2020-02-10 20:52:49,168 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7032 transitions. Word has length 28 [2020-02-10 20:52:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:49,169 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7032 transitions. [2020-02-10 20:52:49,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7032 transitions. [2020-02-10 20:52:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:49,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:49,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:49,171 INFO L427 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:49,171 INFO L82 PathProgramCache]: Analyzing trace with hash -837031964, now seen corresponding path program 891 times [2020-02-10 20:52:49,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:49,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909815610] [2020-02-10 20:52:49,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:49,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909815610] [2020-02-10 20:52:49,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:49,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:49,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473189922] [2020-02-10 20:52:49,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:49,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:49,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:49,674 INFO L87 Difference]: Start difference. First operand 1566 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:52:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:49,903 INFO L93 Difference]: Finished difference Result 2877 states and 11458 transitions. [2020-02-10 20:52:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:49,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:49,910 INFO L225 Difference]: With dead ends: 2877 [2020-02-10 20:52:49,910 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 20:52:49,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 20:52:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1571. [2020-02-10 20:52:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:52:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7041 transitions. [2020-02-10 20:52:49,976 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7041 transitions. Word has length 28 [2020-02-10 20:52:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:49,976 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7041 transitions. [2020-02-10 20:52:49,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7041 transitions. [2020-02-10 20:52:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:49,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:49,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:49,979 INFO L427 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1397075530, now seen corresponding path program 892 times [2020-02-10 20:52:49,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:49,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220036053] [2020-02-10 20:52:49,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:50,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 20:52:50,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220036053] [2020-02-10 20:52:50,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:50,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:50,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199126282] [2020-02-10 20:52:50,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:50,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:50,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:50,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:50,492 INFO L87 Difference]: Start difference. First operand 1571 states and 7041 transitions. Second operand 11 states. [2020-02-10 20:52:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:50,763 INFO L93 Difference]: Finished difference Result 2880 states and 11459 transitions. [2020-02-10 20:52:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:50,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:50,771 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:52:50,771 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 20:52:50,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 20:52:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1566. [2020-02-10 20:52:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:52:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7027 transitions. [2020-02-10 20:52:50,837 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7027 transitions. Word has length 28 [2020-02-10 20:52:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:50,837 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7027 transitions. [2020-02-10 20:52:50,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7027 transitions. [2020-02-10 20:52:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:50,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:50,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:50,840 INFO L427 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1518611492, now seen corresponding path program 893 times [2020-02-10 20:52:50,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:50,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733515613] [2020-02-10 20:52:50,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:51,364 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:52:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:51,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733515613] [2020-02-10 20:52:51,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:51,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:51,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226780960] [2020-02-10 20:52:51,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:51,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:51,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:51,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:51,372 INFO L87 Difference]: Start difference. First operand 1566 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:52:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:51,641 INFO L93 Difference]: Finished difference Result 2880 states and 11460 transitions. [2020-02-10 20:52:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:51,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:51,649 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:52:51,649 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 20:52:51,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 20:52:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1572. [2020-02-10 20:52:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 20:52:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7038 transitions. [2020-02-10 20:52:51,716 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7038 transitions. Word has length 28 [2020-02-10 20:52:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:51,716 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7038 transitions. [2020-02-10 20:52:51,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7038 transitions. [2020-02-10 20:52:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:51,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:51,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] [2020-02-10 20:52:51,719 INFO L427 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1286950808, now seen corresponding path program 894 times [2020-02-10 20:52:51,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:51,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331252633] [2020-02-10 20:52:51,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:52,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331252633] [2020-02-10 20:52:52,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:52,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:52,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774970878] [2020-02-10 20:52:52,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:52,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:52,224 INFO L87 Difference]: Start difference. First operand 1572 states and 7038 transitions. Second operand 11 states. [2020-02-10 20:52:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:52,516 INFO L93 Difference]: Finished difference Result 2882 states and 11458 transitions. [2020-02-10 20:52:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:52,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:52,523 INFO L225 Difference]: With dead ends: 2882 [2020-02-10 20:52:52,523 INFO L226 Difference]: Without dead ends: 2853 [2020-02-10 20:52:52,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2020-02-10 20:52:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1561. [2020-02-10 20:52:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:52:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7015 transitions. [2020-02-10 20:52:52,589 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7015 transitions. Word has length 28 [2020-02-10 20:52:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:52,590 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7015 transitions. [2020-02-10 20:52:52,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7015 transitions. [2020-02-10 20:52:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:52,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:52,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] [2020-02-10 20:52:52,592 INFO L427 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:52,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:52,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1746731620, now seen corresponding path program 895 times [2020-02-10 20:52:52,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:52,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814062196] [2020-02-10 20:52:52,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:53,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814062196] [2020-02-10 20:52:53,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:53,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:53,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713552474] [2020-02-10 20:52:53,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:53,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:53,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:53,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:53,094 INFO L87 Difference]: Start difference. First operand 1561 states and 7015 transitions. Second operand 11 states. [2020-02-10 20:52:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:53,366 INFO L93 Difference]: Finished difference Result 2863 states and 11423 transitions. [2020-02-10 20:52:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:53,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:53,374 INFO L225 Difference]: With dead ends: 2863 [2020-02-10 20:52:53,374 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 20:52:53,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 20:52:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1569. [2020-02-10 20:52:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:52:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7035 transitions. [2020-02-10 20:52:53,441 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7035 transitions. Word has length 28 [2020-02-10 20:52:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:53,441 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7035 transitions. [2020-02-10 20:52:53,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7035 transitions. [2020-02-10 20:52:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:53,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:53,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:53,444 INFO L427 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1803533178, now seen corresponding path program 896 times [2020-02-10 20:52:53,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:53,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424308681] [2020-02-10 20:52:53,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:53,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424308681] [2020-02-10 20:52:53,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:53,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:53,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425313978] [2020-02-10 20:52:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:53,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:53,958 INFO L87 Difference]: Start difference. First operand 1569 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:52:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:54,229 INFO L93 Difference]: Finished difference Result 2864 states and 11420 transitions. [2020-02-10 20:52:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:54,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:54,237 INFO L225 Difference]: With dead ends: 2864 [2020-02-10 20:52:54,237 INFO L226 Difference]: Without dead ends: 2843 [2020-02-10 20:52:54,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-02-10 20:52:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1564. [2020-02-10 20:52:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:52:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7023 transitions. [2020-02-10 20:52:54,306 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7023 transitions. Word has length 28 [2020-02-10 20:52:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:54,306 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7023 transitions. [2020-02-10 20:52:54,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7023 transitions. [2020-02-10 20:52:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:54,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:54,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] [2020-02-10 20:52:54,308 INFO L427 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1370119256, now seen corresponding path program 897 times [2020-02-10 20:52:54,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:54,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932407584] [2020-02-10 20:52:54,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:54,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932407584] [2020-02-10 20:52:54,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:54,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:54,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446323706] [2020-02-10 20:52:54,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:54,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:54,831 INFO L87 Difference]: Start difference. First operand 1564 states and 7023 transitions. Second operand 11 states. [2020-02-10 20:52:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:55,069 INFO L93 Difference]: Finished difference Result 2858 states and 11408 transitions. [2020-02-10 20:52:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:55,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:55,076 INFO L225 Difference]: With dead ends: 2858 [2020-02-10 20:52:55,076 INFO L226 Difference]: Without dead ends: 2843 [2020-02-10 20:52:55,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-02-10 20:52:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1567. [2020-02-10 20:52:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:52:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7028 transitions. [2020-02-10 20:52:55,142 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7028 transitions. Word has length 28 [2020-02-10 20:52:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:55,142 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7028 transitions. [2020-02-10 20:52:55,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7028 transitions. [2020-02-10 20:52:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:55,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:55,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:55,145 INFO L427 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1577717284, now seen corresponding path program 898 times [2020-02-10 20:52:55,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:55,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656739439] [2020-02-10 20:52:55,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:55,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656739439] [2020-02-10 20:52:55,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:55,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:55,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817317649] [2020-02-10 20:52:55,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:55,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:55,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:55,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:55,659 INFO L87 Difference]: Start difference. First operand 1567 states and 7028 transitions. Second operand 11 states. [2020-02-10 20:52:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:55,880 INFO L93 Difference]: Finished difference Result 2856 states and 11401 transitions. [2020-02-10 20:52:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:55,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:55,887 INFO L225 Difference]: With dead ends: 2856 [2020-02-10 20:52:55,887 INFO L226 Difference]: Without dead ends: 2840 [2020-02-10 20:52:55,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2020-02-10 20:52:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1564. [2020-02-10 20:52:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:52:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 20:52:55,955 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 20:52:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:55,955 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 20:52:55,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 20:52:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:55,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:55,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:55,957 INFO L427 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash -614913654, now seen corresponding path program 899 times [2020-02-10 20:52:55,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:55,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610076901] [2020-02-10 20:52:55,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:56,458 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:52:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:56,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610076901] [2020-02-10 20:52:56,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:56,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:56,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662070952] [2020-02-10 20:52:56,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:56,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:56,466 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:52:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:56,664 INFO L93 Difference]: Finished difference Result 2860 states and 11409 transitions. [2020-02-10 20:52:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:56,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:56,672 INFO L225 Difference]: With dead ends: 2860 [2020-02-10 20:52:56,672 INFO L226 Difference]: Without dead ends: 2844 [2020-02-10 20:52:56,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2020-02-10 20:52:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 1567. [2020-02-10 20:52:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:52:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:52:56,739 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:52:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:56,740 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:52:56,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:52:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:56,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:56,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:56,742 INFO L427 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -22720570, now seen corresponding path program 900 times [2020-02-10 20:52:56,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:56,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331348509] [2020-02-10 20:52:56,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:57,259 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:52:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:57,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331348509] [2020-02-10 20:52:57,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:57,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:57,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792848506] [2020-02-10 20:52:57,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:57,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:57,267 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:52:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:57,539 INFO L93 Difference]: Finished difference Result 2857 states and 11400 transitions. [2020-02-10 20:52:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:57,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:57,547 INFO L225 Difference]: With dead ends: 2857 [2020-02-10 20:52:57,547 INFO L226 Difference]: Without dead ends: 2838 [2020-02-10 20:52:57,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2020-02-10 20:52:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 1561. [2020-02-10 20:52:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:52:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7012 transitions. [2020-02-10 20:52:57,613 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7012 transitions. Word has length 28 [2020-02-10 20:52:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:57,613 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7012 transitions. [2020-02-10 20:52:57,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7012 transitions. [2020-02-10 20:52:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:57,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:57,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] [2020-02-10 20:52:57,616 INFO L427 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1324838688, now seen corresponding path program 901 times [2020-02-10 20:52:57,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:57,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090990106] [2020-02-10 20:52:57,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:58,138 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:52:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:58,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090990106] [2020-02-10 20:52:58,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:58,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:58,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278804355] [2020-02-10 20:52:58,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:58,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:58,146 INFO L87 Difference]: Start difference. First operand 1561 states and 7012 transitions. Second operand 11 states. [2020-02-10 20:52:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:58,349 INFO L93 Difference]: Finished difference Result 2867 states and 11428 transitions. [2020-02-10 20:52:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:58,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:58,356 INFO L225 Difference]: With dead ends: 2867 [2020-02-10 20:52:58,356 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 20:52:58,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 20:52:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1569. [2020-02-10 20:52:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:52:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7032 transitions. [2020-02-10 20:52:58,422 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7032 transitions. Word has length 28 [2020-02-10 20:52:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:58,422 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7032 transitions. [2020-02-10 20:52:58,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7032 transitions. [2020-02-10 20:52:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:58,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:58,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:58,425 INFO L427 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -736021114, now seen corresponding path program 902 times [2020-02-10 20:52:58,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:58,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428774090] [2020-02-10 20:52:58,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:58,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428774090] [2020-02-10 20:52:58,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:58,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:58,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609477024] [2020-02-10 20:52:58,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:58,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:58,910 INFO L87 Difference]: Start difference. First operand 1569 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:52:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:59,107 INFO L93 Difference]: Finished difference Result 2870 states and 11429 transitions. [2020-02-10 20:52:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:59,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:59,115 INFO L225 Difference]: With dead ends: 2870 [2020-02-10 20:52:59,115 INFO L226 Difference]: Without dead ends: 2847 [2020-02-10 20:52:59,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2020-02-10 20:52:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1564. [2020-02-10 20:52:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:52:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 20:52:59,180 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 20:52:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:59,181 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 20:52:59,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 20:52:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:59,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:59,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:59,183 INFO L427 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1813018396, now seen corresponding path program 903 times [2020-02-10 20:52:59,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:59,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876253393] [2020-02-10 20:52:59,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:59,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876253393] [2020-02-10 20:52:59,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:59,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:52:59,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371317246] [2020-02-10 20:52:59,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:52:59,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:59,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:52:59,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:59,683 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 20:52:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:59,857 INFO L93 Difference]: Finished difference Result 2860 states and 11409 transitions. [2020-02-10 20:52:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:52:59,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:52:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:59,865 INFO L225 Difference]: With dead ends: 2860 [2020-02-10 20:52:59,865 INFO L226 Difference]: Without dead ends: 2845 [2020-02-10 20:52:59,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:52:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-02-10 20:52:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1567. [2020-02-10 20:52:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:52:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 20:52:59,930 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 20:52:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:59,930 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 20:52:59,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:52:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 20:52:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:52:59,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:59,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:59,933 INFO L427 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1134818144, now seen corresponding path program 904 times [2020-02-10 20:52:59,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:59,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583461065] [2020-02-10 20:52:59,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:00,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583461065] [2020-02-10 20:53:00,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:00,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:00,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712271947] [2020-02-10 20:53:00,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:00,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:00,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:00,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:00,434 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 20:53:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:00,609 INFO L93 Difference]: Finished difference Result 2858 states and 11402 transitions. [2020-02-10 20:53:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:00,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:00,617 INFO L225 Difference]: With dead ends: 2858 [2020-02-10 20:53:00,617 INFO L226 Difference]: Without dead ends: 2842 [2020-02-10 20:53:00,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2020-02-10 20:53:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1564. [2020-02-10 20:53:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:53:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7017 transitions. [2020-02-10 20:53:00,683 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7017 transitions. Word has length 28 [2020-02-10 20:53:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:00,683 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7017 transitions. [2020-02-10 20:53:00,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7017 transitions. [2020-02-10 20:53:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:00,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:00,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] [2020-02-10 20:53:00,685 INFO L427 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash 452598410, now seen corresponding path program 905 times [2020-02-10 20:53:00,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:00,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492165064] [2020-02-10 20:53:00,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:01,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492165064] [2020-02-10 20:53:01,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:01,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:01,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219054708] [2020-02-10 20:53:01,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:01,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:01,181 INFO L87 Difference]: Start difference. First operand 1564 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:53:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:01,362 INFO L93 Difference]: Finished difference Result 2866 states and 11418 transitions. [2020-02-10 20:53:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:01,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:01,369 INFO L225 Difference]: With dead ends: 2866 [2020-02-10 20:53:01,369 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 20:53:01,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 20:53:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1567. [2020-02-10 20:53:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:53:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7022 transitions. [2020-02-10 20:53:01,435 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7022 transitions. Word has length 28 [2020-02-10 20:53:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:01,435 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7022 transitions. [2020-02-10 20:53:01,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7022 transitions. [2020-02-10 20:53:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:01,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:01,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] [2020-02-10 20:53:01,437 INFO L427 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:01,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash 628471878, now seen corresponding path program 906 times [2020-02-10 20:53:01,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:01,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017032102] [2020-02-10 20:53:01,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:01,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017032102] [2020-02-10 20:53:01,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:01,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:01,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146344420] [2020-02-10 20:53:01,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:01,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:01,931 INFO L87 Difference]: Start difference. First operand 1567 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:53:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:02,130 INFO L93 Difference]: Finished difference Result 2861 states and 11405 transitions. [2020-02-10 20:53:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:02,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:02,137 INFO L225 Difference]: With dead ends: 2861 [2020-02-10 20:53:02,138 INFO L226 Difference]: Without dead ends: 2842 [2020-02-10 20:53:02,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2020-02-10 20:53:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1561. [2020-02-10 20:53:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 20:53:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7009 transitions. [2020-02-10 20:53:02,203 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7009 transitions. Word has length 28 [2020-02-10 20:53:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:02,203 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7009 transitions. [2020-02-10 20:53:02,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7009 transitions. [2020-02-10 20:53:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:02,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53: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] [2020-02-10 20:53:02,206 INFO L427 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash -288888928, now seen corresponding path program 907 times [2020-02-10 20:53:02,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:02,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116570387] [2020-02-10 20:53:02,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:02,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116570387] [2020-02-10 20:53:02,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:02,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:02,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268194004] [2020-02-10 20:53:02,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:02,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:02,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:02,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:02,714 INFO L87 Difference]: Start difference. First operand 1561 states and 7009 transitions. Second operand 11 states. [2020-02-10 20:53:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:02,889 INFO L93 Difference]: Finished difference Result 2872 states and 11437 transitions. [2020-02-10 20:53:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:02,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:02,896 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 20:53:02,896 INFO L226 Difference]: Without dead ends: 2856 [2020-02-10 20:53:02,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-02-10 20:53:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1570. [2020-02-10 20:53:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:53:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 20:53:02,961 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 20:53:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:02,961 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 20:53:02,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 20:53:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:02,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:02,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:02,964 INFO L427 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:02,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:02,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1200516068, now seen corresponding path program 908 times [2020-02-10 20:53:02,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:02,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480402023] [2020-02-10 20:53:02,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:03,486 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 20:53:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:03,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480402023] [2020-02-10 20:53:03,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:03,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:03,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493807888] [2020-02-10 20:53:03,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:03,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:03,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:03,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:03,494 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 20:53:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:03,662 INFO L93 Difference]: Finished difference Result 2874 states and 11435 transitions. [2020-02-10 20:53:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:03,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:03,670 INFO L225 Difference]: With dead ends: 2874 [2020-02-10 20:53:03,670 INFO L226 Difference]: Without dead ends: 2850 [2020-02-10 20:53:03,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-02-10 20:53:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1564. [2020-02-10 20:53:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:53:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7017 transitions. [2020-02-10 20:53:03,756 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7017 transitions. Word has length 28 [2020-02-10 20:53:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:03,756 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7017 transitions. [2020-02-10 20:53:03,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7017 transitions. [2020-02-10 20:53:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:03,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:03,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] [2020-02-10 20:53:03,759 INFO L427 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash 868221284, now seen corresponding path program 909 times [2020-02-10 20:53:03,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:03,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885801271] [2020-02-10 20:53:03,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:04,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885801271] [2020-02-10 20:53:04,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:04,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:04,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827839390] [2020-02-10 20:53:04,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:04,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:04,263 INFO L87 Difference]: Start difference. First operand 1564 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:53:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:04,436 INFO L93 Difference]: Finished difference Result 2864 states and 11415 transitions. [2020-02-10 20:53:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:04,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:04,443 INFO L225 Difference]: With dead ends: 2864 [2020-02-10 20:53:04,443 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 20:53:04,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 20:53:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1567. [2020-02-10 20:53:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:53:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7022 transitions. [2020-02-10 20:53:04,508 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7022 transitions. Word has length 28 [2020-02-10 20:53:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:04,509 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7022 transitions. [2020-02-10 20:53:04,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7022 transitions. [2020-02-10 20:53:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:04,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:04,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:04,511 INFO L427 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1460414368, now seen corresponding path program 910 times [2020-02-10 20:53:04,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:04,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433256457] [2020-02-10 20:53:04,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:05,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433256457] [2020-02-10 20:53:05,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:05,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:05,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107845455] [2020-02-10 20:53:05,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:05,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:05,019 INFO L87 Difference]: Start difference. First operand 1567 states and 7022 transitions. Second operand 11 states. [2020-02-10 20:53:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:05,230 INFO L93 Difference]: Finished difference Result 2861 states and 11406 transitions. [2020-02-10 20:53:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:05,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:05,237 INFO L225 Difference]: With dead ends: 2861 [2020-02-10 20:53:05,237 INFO L226 Difference]: Without dead ends: 2845 [2020-02-10 20:53:05,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-02-10 20:53:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1564. [2020-02-10 20:53:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 20:53:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7014 transitions. [2020-02-10 20:53:05,302 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7014 transitions. Word has length 28 [2020-02-10 20:53:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:05,302 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7014 transitions. [2020-02-10 20:53:05,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7014 transitions. [2020-02-10 20:53:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:05,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:05,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:05,305 INFO L427 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1916334808, now seen corresponding path program 911 times [2020-02-10 20:53:05,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:05,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127570262] [2020-02-10 20:53:05,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:05,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127570262] [2020-02-10 20:53:05,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:05,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:05,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957035180] [2020-02-10 20:53:05,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:05,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:05,806 INFO L87 Difference]: Start difference. First operand 1564 states and 7014 transitions. Second operand 11 states. [2020-02-10 20:53:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:05,988 INFO L93 Difference]: Finished difference Result 2868 states and 11420 transitions. [2020-02-10 20:53:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:05,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:05,995 INFO L225 Difference]: With dead ends: 2868 [2020-02-10 20:53:05,995 INFO L226 Difference]: Without dead ends: 2850 [2020-02-10 20:53:05,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-02-10 20:53:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1567. [2020-02-10 20:53:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:53:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7019 transitions. [2020-02-10 20:53:06,061 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7019 transitions. Word has length 28 [2020-02-10 20:53:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:06,061 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7019 transitions. [2020-02-10 20:53:06,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7019 transitions. [2020-02-10 20:53:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:06,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:06,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] [2020-02-10 20:53:06,064 INFO L427 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1740461340, now seen corresponding path program 912 times [2020-02-10 20:53:06,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:06,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957606367] [2020-02-10 20:53:06,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:06,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957606367] [2020-02-10 20:53:06,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:06,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:06,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450272975] [2020-02-10 20:53:06,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:06,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:06,577 INFO L87 Difference]: Start difference. First operand 1567 states and 7019 transitions. Second operand 11 states. [2020-02-10 20:53:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:06,781 INFO L93 Difference]: Finished difference Result 2863 states and 11407 transitions. [2020-02-10 20:53:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:06,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:06,788 INFO L225 Difference]: With dead ends: 2863 [2020-02-10 20:53:06,789 INFO L226 Difference]: Without dead ends: 2841 [2020-02-10 20:53:06,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2020-02-10 20:53:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 1558. [2020-02-10 20:53:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 20:53:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7001 transitions. [2020-02-10 20:53:06,853 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7001 transitions. Word has length 28 [2020-02-10 20:53:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:06,854 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7001 transitions. [2020-02-10 20:53:06,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7001 transitions. [2020-02-10 20:53:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:06,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:06,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:06,856 INFO L427 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1750104872, now seen corresponding path program 913 times [2020-02-10 20:53:06,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:06,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248804021] [2020-02-10 20:53:06,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:07,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248804021] [2020-02-10 20:53:07,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:07,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:07,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321905391] [2020-02-10 20:53:07,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:07,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:07,369 INFO L87 Difference]: Start difference. First operand 1558 states and 7001 transitions. Second operand 11 states. [2020-02-10 20:53:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:07,540 INFO L93 Difference]: Finished difference Result 2908 states and 11528 transitions. [2020-02-10 20:53:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:07,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:07,548 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:53:07,548 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 20:53:07,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 20:53:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1576. [2020-02-10 20:53:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 20:53:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7057 transitions. [2020-02-10 20:53:07,614 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7057 transitions. Word has length 28 [2020-02-10 20:53:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:07,614 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7057 transitions. [2020-02-10 20:53:07,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7057 transitions. [2020-02-10 20:53:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:07,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:07,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:07,617 INFO L427 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1055457428, now seen corresponding path program 914 times [2020-02-10 20:53:07,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:07,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679237482] [2020-02-10 20:53:07,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:08,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679237482] [2020-02-10 20:53:08,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:08,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:08,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359874558] [2020-02-10 20:53:08,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:08,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:08,137 INFO L87 Difference]: Start difference. First operand 1576 states and 7057 transitions. Second operand 11 states. [2020-02-10 20:53:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:08,316 INFO L93 Difference]: Finished difference Result 2913 states and 11532 transitions. [2020-02-10 20:53:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:08,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:08,324 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 20:53:08,324 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 20:53:08,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 20:53:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1570. [2020-02-10 20:53:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:53:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7040 transitions. [2020-02-10 20:53:08,391 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7040 transitions. Word has length 28 [2020-02-10 20:53:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:08,391 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7040 transitions. [2020-02-10 20:53:08,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7040 transitions. [2020-02-10 20:53:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:08,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:08,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] [2020-02-10 20:53:08,393 INFO L427 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:08,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash -933921466, now seen corresponding path program 915 times [2020-02-10 20:53:08,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:08,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409314588] [2020-02-10 20:53:08,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:08,911 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 20:53:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:08,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409314588] [2020-02-10 20:53:08,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:08,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:08,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718020670] [2020-02-10 20:53:08,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:08,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:08,919 INFO L87 Difference]: Start difference. First operand 1570 states and 7040 transitions. Second operand 11 states. [2020-02-10 20:53:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:09,111 INFO L93 Difference]: Finished difference Result 2905 states and 11517 transitions. [2020-02-10 20:53:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:09,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:09,119 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 20:53:09,119 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 20:53:09,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 20:53:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1575. [2020-02-10 20:53:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 20:53:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7049 transitions. [2020-02-10 20:53:09,185 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7049 transitions. Word has length 28 [2020-02-10 20:53:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:09,185 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7049 transitions. [2020-02-10 20:53:09,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7049 transitions. [2020-02-10 20:53:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:09,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:09,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] [2020-02-10 20:53:09,188 INFO L427 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1300186028, now seen corresponding path program 916 times [2020-02-10 20:53:09,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:09,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166831118] [2020-02-10 20:53:09,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:09,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166831118] [2020-02-10 20:53:09,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:09,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:09,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853298064] [2020-02-10 20:53:09,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:09,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:09,713 INFO L87 Difference]: Start difference. First operand 1575 states and 7049 transitions. Second operand 11 states. [2020-02-10 20:53:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:09,877 INFO L93 Difference]: Finished difference Result 2908 states and 11518 transitions. [2020-02-10 20:53:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:09,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:09,885 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 20:53:09,885 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 20:53:09,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 20:53:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1570. [2020-02-10 20:53:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:53:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7035 transitions. [2020-02-10 20:53:09,948 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7035 transitions. Word has length 28 [2020-02-10 20:53:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:09,948 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7035 transitions. [2020-02-10 20:53:09,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7035 transitions. [2020-02-10 20:53:09,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:09,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:09,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] [2020-02-10 20:53:09,950 INFO L427 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash -517601850, now seen corresponding path program 917 times [2020-02-10 20:53:09,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:09,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741396615] [2020-02-10 20:53:09,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:10,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741396615] [2020-02-10 20:53:10,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:10,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:10,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378552557] [2020-02-10 20:53:10,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:10,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:10,452 INFO L87 Difference]: Start difference. First operand 1570 states and 7035 transitions. Second operand 11 states. [2020-02-10 20:53:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:10,587 INFO L93 Difference]: Finished difference Result 2920 states and 11542 transitions. [2020-02-10 20:53:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:10,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:10,594 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 20:53:10,594 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 20:53:10,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 20:53:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1580. [2020-02-10 20:53:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 20:53:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7052 transitions. [2020-02-10 20:53:10,658 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7052 transitions. Word has length 28 [2020-02-10 20:53:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:10,658 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7052 transitions. [2020-02-10 20:53:10,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7052 transitions. [2020-02-10 20:53:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:10,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:10,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:10,661 INFO L427 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:10,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash 227100648, now seen corresponding path program 918 times [2020-02-10 20:53:10,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:10,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987889652] [2020-02-10 20:53:10,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:11,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987889652] [2020-02-10 20:53:11,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:11,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:11,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001198180] [2020-02-10 20:53:11,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:11,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:11,155 INFO L87 Difference]: Start difference. First operand 1580 states and 7052 transitions. Second operand 11 states. [2020-02-10 20:53:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:11,353 INFO L93 Difference]: Finished difference Result 2918 states and 11530 transitions. [2020-02-10 20:53:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:11,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:11,361 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 20:53:11,361 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 20:53:11,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 20:53:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1563. [2020-02-10 20:53:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:53:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7017 transitions. [2020-02-10 20:53:11,424 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7017 transitions. Word has length 28 [2020-02-10 20:53:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:11,424 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7017 transitions. [2020-02-10 20:53:11,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7017 transitions. [2020-02-10 20:53:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:11,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:11,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] [2020-02-10 20:53:11,427 INFO L427 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1034184220, now seen corresponding path program 919 times [2020-02-10 20:53:11,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:11,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155303528] [2020-02-10 20:53:11,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:11,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155303528] [2020-02-10 20:53:11,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:11,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:11,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216723243] [2020-02-10 20:53:11,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:11,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:11,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:11,906 INFO L87 Difference]: Start difference. First operand 1563 states and 7017 transitions. Second operand 11 states. [2020-02-10 20:53:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:12,072 INFO L93 Difference]: Finished difference Result 2892 states and 11481 transitions. [2020-02-10 20:53:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:12,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:12,079 INFO L225 Difference]: With dead ends: 2892 [2020-02-10 20:53:12,079 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 20:53:12,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 20:53:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1573. [2020-02-10 20:53:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 20:53:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7042 transitions. [2020-02-10 20:53:12,142 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7042 transitions. Word has length 28 [2020-02-10 20:53:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:12,143 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7042 transitions. [2020-02-10 20:53:12,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7042 transitions. [2020-02-10 20:53:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:12,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:12,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:12,145 INFO L427 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash 455220776, now seen corresponding path program 920 times [2020-02-10 20:53:12,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:12,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72962828] [2020-02-10 20:53:12,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:12,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72962828] [2020-02-10 20:53:12,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:12,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:12,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041419375] [2020-02-10 20:53:12,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:12,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:12,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:12,631 INFO L87 Difference]: Start difference. First operand 1573 states and 7042 transitions. Second operand 11 states. [2020-02-10 20:53:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:12,765 INFO L93 Difference]: Finished difference Result 2897 states and 11485 transitions. [2020-02-10 20:53:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:12,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:12,771 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 20:53:12,772 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 20:53:12,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 20:53:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1567. [2020-02-10 20:53:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:53:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7027 transitions. [2020-02-10 20:53:12,835 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7027 transitions. Word has length 28 [2020-02-10 20:53:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:12,836 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7027 transitions. [2020-02-10 20:53:12,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7027 transitions. [2020-02-10 20:53:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:12,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:12,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:12,838 INFO L427 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash 133429096, now seen corresponding path program 921 times [2020-02-10 20:53:12,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:12,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175087851] [2020-02-10 20:53:12,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:13,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175087851] [2020-02-10 20:53:13,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:13,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:13,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540286302] [2020-02-10 20:53:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:13,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:13,318 INFO L87 Difference]: Start difference. First operand 1567 states and 7027 transitions. Second operand 11 states. [2020-02-10 20:53:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:13,483 INFO L93 Difference]: Finished difference Result 2882 states and 11456 transitions. [2020-02-10 20:53:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:13,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:13,490 INFO L225 Difference]: With dead ends: 2882 [2020-02-10 20:53:13,490 INFO L226 Difference]: Without dead ends: 2867 [2020-02-10 20:53:13,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-02-10 20:53:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1570. [2020-02-10 20:53:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 20:53:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 20:53:13,552 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 20:53:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:13,552 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 20:53:13,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 20:53:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:13,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:13,555 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:13,555 INFO L427 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1213701660, now seen corresponding path program 922 times [2020-02-10 20:53:13,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:13,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802997851] [2020-02-10 20:53:13,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:14,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 20:53:14,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802997851] [2020-02-10 20:53:14,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320473121] [2020-02-10 20:53:14,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:14,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:14,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:14,069 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 20:53:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:14,240 INFO L93 Difference]: Finished difference Result 2880 states and 11449 transitions. [2020-02-10 20:53:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:14,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:14,246 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 20:53:14,247 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 20:53:14,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 20:53:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1567. [2020-02-10 20:53:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 20:53:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7024 transitions. [2020-02-10 20:53:14,309 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7024 transitions. Word has length 28 [2020-02-10 20:53:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:14,309 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7024 transitions. [2020-02-10 20:53:14,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7024 transitions. [2020-02-10 20:53:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:14,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:14,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:14,311 INFO L427 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1643840300, now seen corresponding path program 923 times [2020-02-10 20:53:14,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:14,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940629239] [2020-02-10 20:53:14,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:14,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940629239] [2020-02-10 20:53:14,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:14,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:14,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035788591] [2020-02-10 20:53:14,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:14,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:14,798 INFO L87 Difference]: Start difference. First operand 1567 states and 7024 transitions. Second operand 11 states. [2020-02-10 20:53:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:14,923 INFO L93 Difference]: Finished difference Result 2893 states and 11473 transitions. [2020-02-10 20:53:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:14,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:14,930 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 20:53:14,930 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 20:53:14,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 20:53:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1571. [2020-02-10 20:53:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:53:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7030 transitions. [2020-02-10 20:53:14,992 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7030 transitions. Word has length 28 [2020-02-10 20:53:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:14,992 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7030 transitions. [2020-02-10 20:53:14,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7030 transitions. [2020-02-10 20:53:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:14,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:14,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:14,995 INFO L427 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash -119610072, now seen corresponding path program 924 times [2020-02-10 20:53:14,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:14,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140046464] [2020-02-10 20:53:14,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:15,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140046464] [2020-02-10 20:53:15,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:15,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:15,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758064494] [2020-02-10 20:53:15,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:15,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:15,465 INFO L87 Difference]: Start difference. First operand 1571 states and 7030 transitions. Second operand 11 states. [2020-02-10 20:53:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:15,626 INFO L93 Difference]: Finished difference Result 2886 states and 11456 transitions. [2020-02-10 20:53:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:15,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:15,634 INFO L225 Difference]: With dead ends: 2886 [2020-02-10 20:53:15,634 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 20:53:15,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 20:53:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1563. [2020-02-10 20:53:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 20:53:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7013 transitions. [2020-02-10 20:53:15,697 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7013 transitions. Word has length 28 [2020-02-10 20:53:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:15,697 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7013 transitions. [2020-02-10 20:53:15,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7013 transitions. [2020-02-10 20:53:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:15,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:15,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] [2020-02-10 20:53:15,700 INFO L427 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash 902352962, now seen corresponding path program 925 times [2020-02-10 20:53:15,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:15,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703152410] [2020-02-10 20:53:15,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:16,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703152410] [2020-02-10 20:53:16,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:16,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:16,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394884376] [2020-02-10 20:53:16,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:16,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:16,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:16,165 INFO L87 Difference]: Start difference. First operand 1563 states and 7013 transitions. Second operand 11 states. [2020-02-10 20:53:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:16,345 INFO L93 Difference]: Finished difference Result 2884 states and 11462 transitions. [2020-02-10 20:53:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:16,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:16,353 INFO L225 Difference]: With dead ends: 2884 [2020-02-10 20:53:16,353 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 20:53:16,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 20:53:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1571. [2020-02-10 20:53:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 20:53:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7033 transitions. [2020-02-10 20:53:16,416 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7033 transitions. Word has length 28 [2020-02-10 20:53:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:16,417 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7033 transitions. [2020-02-10 20:53:16,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7033 transitions. [2020-02-10 20:53:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:16,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:16,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:16,419 INFO L427 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1158506840, now seen corresponding path program 926 times [2020-02-10 20:53:16,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:16,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995067979] [2020-02-10 20:53:16,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:16,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995067979] [2020-02-10 20:53:16,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:16,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:16,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617368872] [2020-02-10 20:53:16,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:16,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:16,880 INFO L87 Difference]: Start difference. First operand 1571 states and 7033 transitions. Second operand 11 states. [2020-02-10 20:53:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:17,046 INFO L93 Difference]: Finished difference Result 2887 states and 11463 transitions. [2020-02-10 20:53:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:17,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:17,054 INFO L225 Difference]: With dead ends: 2887 [2020-02-10 20:53:17,054 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 20:53:17,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 20:53:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1566. [2020-02-10 20:53:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 20:53:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7021 transitions. [2020-02-10 20:53:17,117 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7021 transitions. Word has length 28 [2020-02-10 20:53:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:17,117 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7021 transitions. [2020-02-10 20:53:17,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7021 transitions. [2020-02-10 20:53:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:17,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:17,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] [2020-02-10 20:53:17,119 INFO L427 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2059463174, now seen corresponding path program 927 times [2020-02-10 20:53:17,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:17,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176896320] [2020-02-10 20:53:17,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:17,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 20:53:17,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176896320] [2020-02-10 20:53:17,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:17,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:17,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117714473] [2020-02-10 20:53:17,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:17,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:17,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:17,594 INFO L87 Difference]: Start difference. First operand 1566 states and 7021 transitions. Second operand 11 states. [2020-02-10 20:53:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:17,757 INFO L93 Difference]: Finished difference Result 2877 states and 11443 transitions. [2020-02-10 20:53:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:17,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:17,764 INFO L225 Difference]: With dead ends: 2877 [2020-02-10 20:53:17,764 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 20:53:17,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:53:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 20:53:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1569. [2020-02-10 20:53:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 20:53:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7026 transitions. [2020-02-10 20:53:17,828 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7026 transitions. Word has length 28 [2020-02-10 20:53:17,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:17,828 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7026 transitions. [2020-02-10 20:53:17,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 20:53:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7026 transitions. [2020-02-10 20:53:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 20:53:17,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:17,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:17,830 INFO L427 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 712332418, now seen corresponding path program 928 times [2020-02-10 20:53:17,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:17,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039349289] [2020-02-10 20:53:17,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:18,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039349289] [2020-02-10 20:53:18,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:18,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 20:53:18,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222925433] [2020-02-10 20:53:18,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 20:53:18,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 20:53:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:18,304 INFO L87 Difference]: Start difference. First operand 1569 states and 7026 transitions. Second operand 11 states. [2020-02-10 20:53:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:18,489 INFO L93 Difference]: Finished difference Result 2875 states and 11436 transitions. [2020-02-10 20:53:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 20:53:18,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 20:53:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:18,496 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 20:53:18,497 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 20:53:18,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 Received shutdown request... [2020-02-10 20:53:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 20:53:18,542 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:53:18,545 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:53:18,545 INFO L202 PluginConnector]: Adding new model example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:53:18 BasicIcfg [2020-02-10 20:53:18,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:53:18,546 INFO L168 Benchmark]: Toolchain (without parser) took 770507.97 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 120.3 MB in the beginning and 205.5 MB in the end (delta: -85.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-02-10 20:53:18,547 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:53:18,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 138.4 MB. Free memory was 120.1 MB in the beginning and 118.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:18,548 INFO L168 Benchmark]: Boogie Preprocessor took 20.09 ms. Allocated memory is still 138.4 MB. Free memory was 118.4 MB in the beginning and 117.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:18,548 INFO L168 Benchmark]: RCFGBuilder took 395.28 ms. Allocated memory is still 138.4 MB. Free memory was 117.1 MB in the beginning and 103.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:18,548 INFO L168 Benchmark]: TraceAbstraction took 770051.35 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 102.6 MB in the beginning and 205.5 MB in the end (delta: -102.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-02-10 20:53:18,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 138.4 MB. Free memory was 120.1 MB in the beginning and 118.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.09 ms. Allocated memory is still 138.4 MB. Free memory was 118.4 MB in the beginning and 117.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 395.28 ms. Allocated memory is still 138.4 MB. Free memory was 117.1 MB in the beginning and 103.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 770051.35 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 102.6 MB in the beginning and 205.5 MB in the end (delta: -102.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 76 ProgramPointsBefore, 66 ProgramPointsAfterwards, 120 TransitionsBefore, 110 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 720 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 756 CheckedPairsTotal, 10 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 769.8s, OverallIterations: 936, TraceHistogramMax: 1, AutomataDifference: 191.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 114453 SDtfs, 167652 SDslu, 304053 SDs, 0 SdLazy, 82746 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10232 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 9288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6496 ImplicationChecksByTransitivity, 542.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20196occurred 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: 69.5s AutomataMinimizationTime, 936 MinimizatonAttempts, 1261461 StatesRemovedByMinimization, 927 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 492.1s InterpolantComputationTime, 26208 NumberOfCodeBlocks, 26208 NumberOfCodeBlocksAsserted, 936 NumberOfCheckSat, 25272 ConstructedInterpolants, 0 QuantifiedInterpolants, 22439322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 936 InterpolantComputations, 936 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